Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Modifying edges of a network to obtain short subgraphs
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Improving spanning trees by upgrading nodes
Theoretical Computer Science
Upgrading bottleneck constrained forests
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Bicriteria Network Design Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A new algorithm for the recognition of series parallel graphs
A new algorithm for the recognition of series parallel graphs
| Hi-index | 0.00 |
We examine a network upgrade problem for cost flows. A budget can be distributed among the arcs of the network. An investment on a single arc can be used either to decrease the arc flow cost, or to increase the arc capacity, or both. The goal is to maximize the flow through the network while not exceeding bounds on the budget and on the total flow cost. The problems are NP-hard even on series-parallel graphs. We provide an approximation algorithm on series-parallel graphs which, for arbitrary δ, Ɛ 0, produces a solution which exceeds the bounds on the budget and the flow cost by factors 1+δ and 1+Ɛ, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δƐ).