S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, in Proceedings of the 24nd International Colloquium on Automata, Languages and Programming (ICALP'97), vol. 1256 of Lecture Notes in Computer Science, 1997, pp. 281-291.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of several natural network improvement problems. The results obtained in this paper are summarized in Tables 1 and 2. Our results raise additional questions. It is worth considering other related network improvement network design or location problems. As a step in this direction, in [16], we have considered node based network improvement problems and provided both hardness and approximation results for a number of such problems. Also, it would be interesting to look at the above problems for special classes of graphs such as grid graphs, perfect graphs and investigate the ....

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, in Proceedings of the 24nd International Colloquium on Automata, Languages and Programming (ICALP'97), vol. 1256 of Lecture Notes in Computer Science, 1997, pp. 281-291.

No context found.

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281--291.

No context found.

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281--291.

No context found.

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, Proceedings of the 24nd International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281--291.

No context found.

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, Proceedings of the 24nd International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281--291.

....Algorithms 1. Introduction and Motivation Several problems arising in areas such as communication networks and VLSI design can be expressed in the following general form: Enhance the performance of an underlying network by carrying out upgrades at certain nodes and or edges of the network [7, 19, 21, 13, 14]. Consider the following scenario which best illustrates the type of problems we investigate. A large communication company is approached by a client with the 2 requirement to interconnect a set of cities housing the client s oces (e.g. banks with high transaction rates between branches) The ....

....in nding optimal networks (e.g. spanning trees) in graphs, signi cantly less work has been reported on how to modify a graph so as to optimize the cost of a suitable subgraph of the resulting graph, when there is a budget constraint on the modi cation cost. Here, building on our recent work in [13, 14], we formulate and study such budget constrained optimal network upgrading problems. The paper is organized as follows. Section 2 introduces the node and edge based upgrading models. In Section 3 we formally de ne the problems under study. In Section 5, we discuss the robustness and generality of ....

[Article contains additional citation context not shown here]

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving Spanning Trees by Upgrading Nodes, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy, July 1997, pp. 281-291.

....Algorithms 1. Introduction and Motivation Several problems arising in areas such as communication networks and VLSI design can be expressed in the following general form: Enhance the performance of an underlying network by carrying out upgrades at certain nodes and or edges of the network [7, 19, 21, 13, 14]. Consider the following scenario which best illustrates the type of problems we investigate. A large communication company is approached by a client with the 2 requirement to interconnect a set of cities housing the client s offices (e.g. banks with high transaction rates between branches) The ....

....in finding optimal networks (e.g. spanning trees) in graphs, significantly less work has been reported on how to modify a graph so as to optimize the cost of a suitable subgraph of the resulting graph, when there is a budget constraint on the modification cost. Here, building on our recent work in [13, 14], we formulate and study such budget constrained optimal network upgrading problems. The paper is organized as follows. Section 2 introduces the node and edge based upgrading models. In Section 3 we formally define the problems under study. In Section 5, we discuss the robustness and generality ....

[Article contains additional citation context not shown here]

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving Spanning Trees by Upgrading Nodes, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy, July 1997, pp. 281--291.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC