| Alternate document: Details Approximation Algorithms for Channel Assignment in Radio Networks (98) Sven O. Krumke, Madhav V. Marathe, S.S. Ravi |
Sven O. Krumke et al.  Home/Search
Context Related
| info1.informatik.uniwuer...aacnp.ps.gz lanl.gov/~madhav/pub...improvejco.ps.Z Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: info1.informatik.u...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study budget constrained network upgrading problems. Such problems aim at finding optimal strategies for improving a network under some cost measure subject to certain budget constraints. Given an edge weighted graph G = (V; E), in the edge based upgrading model, it is assumed that each edge e of the given network also has an associated function ce (t) that specifies the cost of upgrading the edge by an amount t. A reduction strategy specifies for each edge e the amount by which the length... (Update)
Similar documents based on text: More All
0.8: Approximation Algorithms for Certain Network Improvement Problems - Krumke, al. (1998) (Correct)
0.6: Improving Spanning Trees by Upgrading Nodes - Krumke, Marathe, Noltemeir.. (1997) (Correct)
0.6: Upgrading Bottleneck Constrained Forests - Krumke, Marathe, Noltemeier.. (Correct)
BibTeX entry: (Update)
S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi and S.S. Ravi, Approximation algorithms for certain network improvement problems, Journal of Combinatorial Optimization 2, 1998, 257-288. http://citeseer.ist.psu.edu/krumke98approximation.html More
@article{ krumke98approximation,
author = "S. Krumke and M. Marathe and H. Noltemeier and R. Ravi and S. Ravi",
title = "Approximation algorithms for certain network improvement problems",
journal = "Journal of Combinatorial Optimization",
volume = "2",
pages = "257--288",
year = "1998",
url = "citeseer.ist.psu.edu/krumke98approximation.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
206 Rinehart and Winston (context) - Lawler, optimization et al. - 1976
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1995
115 PCPs and non-approximability --- towards tight results (context) - Bellare, Goldreich et al. - 1995
61 Approximation schemes for the restricted shortest path probl.. (context) - Hassin - 1992
47 Bicriteria network design problems - Marathe, Ravi et al. - 1995
45 Linear-Time Computation of Optimal Subgraphs of Decomposable.. (context) - Bern, Lawler et al. - 1987
44 Many birds with one stone: Multi-objective approximation alg.. - Ravi, Marathe et al. - 1993
41 Adding multiple cost constraints to combinatorial optimizati.. - Karger, Plotkin - 1995
33 The network inhibition problem (context) - Phillips - 1993
28 Euler tours and the Chinese postman (context) - Edmonds, Johnson - 1973
21 Approximation of pareto optima in multiple-objective shortes.. (context) - Warburton - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www-info1.informatik.uni-wuerzburg.de/publications/noltemeier/publications.html): More
Improving Steiner Trees of a Network Under Multiple Constraints .. - Krumke, al. (1997) (Correct)
Modifying Networks to Obtain Low Cost Trees - Krumke, Noltemeier, Marathe.. (1996) (Correct)
Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (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