Approximation algorithms for finding low-degree subgraphs
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning TreesSIAM Journal on Computing, 2002
- Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design ProblemsAlgorithmica, 2001
- 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
- Approximating the Minimum-Degree Steiner Tree to within One of OptimalJournal of Algorithms, 1994
- Recognizing tough graphs is NP-hardDiscrete Applied Mathematics, 1990
- Integer and Combinatorial Optimization1988
- Geometric Algorithms and Combinatorial Optimization1988
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973