Bicriteria Network Design Problems
- 1 July 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 28 (1) , 142-171
- https://doi.org/10.1006/jagm.1998.0930
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Improved Low-Degree Testing and its ApplicationsCombinatorica, 2003
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Construction of optimal graphs for bit-vector compressionPublished by Association for Computing Machinery (ACM) ,1989
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Multicast Communication on Network ComputersIEEE Software, 1985
- The Bounded Path Tree ProblemSIAM Journal on Algebraic Discrete Methods, 1982
- Minimal ratio spanning treesNetworks, 1977