S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth  Home/Search
Context Related
| zib.de/krumke/Postscrip...icalp97.ps.gz cmu.edu/andrew/ravi/public...upgrade.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: zib.de/krumke/publications (more) From: cmu.edu/andrew/ravi/public...temp (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We study budget constrained optimal network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. We consider two performance measures, namely, the weight of a minimum spanning tree and the bottleneck weight of a minimum bottleneck spanning tree, and... (Update)
Context of citations to this paper: More
...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...
Cited by: More
Modifying Edges of a Network to Obtain Short Subgraphs - Drangmeister, Krumke, al. (2000) (Correct)
Improving Minimum Cost Spanning Trees by Upgrading Nodes - Krumke, Marathe.. (Correct)
Upgrading Bottleneck Constrained Forests - Krumke, Marathe, Noltemeier.. (Correct)
Similar documents (at the sentence level):
9.7%: Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeir.. (1997) (Correct)
5.4%: On the Approximability of Location and Network Design Problems - Krumke (1996) (Correct)
Active bibliography (related documents): More All
0.4: Node Weighted Network Upgrade Problems (Extended Abstract) - Krumke, Noltemeier.. (1997) (Correct)
0.4: Approximation Algorithms for Certain Network Improvement Problems - Krumke, al. (1998) (Correct)
0.3: Improving Steiner Trees of a Network Under Multiple Constraints .. - Krumke, al. (1997) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Modifying Edges of a Network to Obtain Short Subgroups - Drangmeister, Krumke.. (1996) (Correct)
0.4: Models and Approximation Algorithms for Channel Assignment .. - Krumke, Marathe, Ravi (2000) (Correct)
Related documents from co-citation: More All
7: Improving The Location of Minisum Facilities Through Network Modification (context) - Berman - 1992
7: The Network Inhibition Problem (context) - Phillips - 1993
5: Network upgrading problems (context) - Paik, Sahni - 1995
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/article/krumke97improving.html More
@article{ krumke99improving,
author = "Sven O. Krumke and Hartmut Noltemeier and Hans-C. Wirth and Madhav V. Marathe and R. Ravi and S. S. Ravi and R. Sundaram",
title = "Improving spanning trees by upgrading nodes",
journal = "Theoretical Computer Science",
volume = "221",
number = "1--2",
pages = "139--155",
year = "1999",
url = "citeseer.ist.psu.edu/article/krumke97improving.html" }
Citations (may not include all citations):168 An Approximate Max-Flow Min-Cut Theorem for Uniform Multicom.. (context) - Leighton, Rao - 1988
47 Bicriteria Network Design Problems - Marathe, Ravi et al. - 1995
33 The Network Inhibition Problem (context) - Phillips - 1993
30 A threshold of ln n for approximating set cover - Feige - 1996
15 Increasing the Weight of Minimum Spanning Trees - Frederickson, Solis-Oba - 1996
13 Improving The Location of Minisum Facilities Through Network.. (context) - Berman - 1992
11 The Constrained Minimum Spanning Tree Problem (context) - Ravi, Goemans - 1996
8 Modifying Networks to Obtain Low Cost Trees - Krumke, Noltemeier et al. - 1996
8 Network Upgrading Problems (context) - Paik, Sahni - 1995
7 The Complexity of Designing a Network with Minimum Diameter (context) - Plesnik - 1981
3 Improving Steiner Trees of a Network Under Multiple Constrai.. - Krumke, Noltemeier et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zib.de/krumke/publications.html): More
Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (Correct)
Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
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