S.O. Krumke, H. Noltemeier, M.V. Marathe, S.S. Ravi  Home/Search
Context
Related
| zib.de/krumke/Postscript...tr1467.ps.gz info1.informatik.uniwue...tr1467.ps.gz 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: info1.informatik.u...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) S.O. Krumke 1 H. Noltemeier 1 M.V. Marathe 2 S.S. Ravi 3 January 22, 1997 Abstract Several problems arising in the areas of communication networks and VLSI design can be expressed in the following general form: Enhance the performance of an underlying network by upgrading some of its nodes. We investigate one such problem. Consider a network where nodes represent processors and edges represent bidirectional communication links. The processor at a node v can be upgraded at an expense... (Update)
Similar documents based on text: More All
0.3: Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeier.. (1997) (Correct)
0.3: Improving Minimum Cost Spanning Trees by Upgrading Nodes - Krumke, Marathe.. (Correct)
0.3: Upgrading Bottleneck Constrained Forests - Krumke, Marathe, Noltemeier.. (Correct)
BibTeX entry: (Update)
@misc{ krumke-node,
author = "S.O. Krumke and H. Noltemeier and M.V. Marathe and S.S. Ravi",
title = "Node Weighted Network Upgrade Problems (Extended Abstract)",
url = "citeseer.ist.psu.edu/krumke97node.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
300 the Hardness of Approximating Minimization Problems (context) - Lund, Yannakakis - 1993
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
168 An Approximate Max-Flow Min-Cut Theorem for Uniform Multicom.. (context) - Leighton, Rao - 1998
145 Easy Problems for Tree-Decomposable Graphs - Arnborg, Lagergren et al. - 1991
130 Multicast Routing for Multimedia Communication - Kompella, Pasquale et al. - 1993
92 A compendium of NP optimization problems - Crescenzi, Kann - 1995
74 The Recognition of Series-Parallel Digraphs (context) - Valdes, Tarjan et al. - 1982
68 Provably Good Performance Driven Global Routing (context) - Cong, Kahng et al. - 1992
45 Linear-Time Computation of Optimal Subgraphs of Decomposable.. (context) - Bern, Lawler et al. - 1987
41 Adding Multiple Cost Constraints to Combinatorial Optimizati.. - Karger, Plotkin - 1995
40 A unified approach to approximation algorithms for bottlenec.. (context) - Hochbaum, Shmoys - 1986
33 The Network Inhibition Problem (context) - Phillips - 1993
33 Critical Net Routing (context) - Cohoon, Randall - 1991
32 Dynamic programming algorithms on graphs with bounded treewi.. (context) - Bodlaender - 1988
[Article contains additional citations not shown here]
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