Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Finding k-cuts within twice the optimal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A buffer distribution algorithm for high-speed clock routing
DAC '93 Proceedings of the 30th international Design Automation Conference
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Finding long paths and cycles in sparse Hamiltonian graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Bootstrapping Free-Space Optical Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Finding large cycles in Hamiltonian graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding small balanced separators
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Spanning trees with minimum weighted degrees
Information Processing Letters
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Approximating the Maximum Internal Spanning Tree problem
Theoretical Computer Science
Finding large cycles in Hamiltonian graphs
Discrete Applied Mathematics
Fast user notification in large-scale digital libraries: experiments and results
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Journal of Parallel and Distributed Computing
Top-k query evaluation in sensor networks under query response time constraint
Information Sciences: an International Journal
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Labeling schemes for tree representation
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
IEEE/ACM Transactions on Networking (TON)
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the problem of constructing a spanning tree for a graph G = (V,E) with n vertices whose maximal degree is the smallest among all spanning trees of G. This problem is easily shown to be NP-hard. We describe an iterative polynomial time approximation algorithm for this problem. This algorithm computes a spanning tree whose maximal degree is at most O(&Dgr; + log n), where &Dgr; is the degree of some optimal tree. The result is generalized to the case where only some vertices need to be connected (Steiner case) and to the case of directed graphs. It is then shown that our algorithm can be refined to produce a spanning tree of degree at most &Dgr; + 1. Unless P = NP, this is the best bound achievable in polynomial time.