Spanning Trees—Short or Small

DOI10.1137/S0895480194266331zbMath0855.05058arXivmath/9409222WikidataQ56474460 ScholiaQ56474460MaRDI QIDQ4881285

S. S. Ravi, R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz

Publication date: 24 July 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9409222

zbMATH Keywords

planar graphs; chordal graphs; connected graph; choosability; color; list coloring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

Related Items

Differential approximation of NP-hard problems with equal size feasible solutions, Approximation algorithms for the covering Steiner problem, A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs, Revisiting dynamic programming for finding optimal subtrees in trees, Budget constrained minimum cost connected medians, On \(k\)-Max-optimization, Compact location problems, The complexity of minimizing certain cost metrics for \(k\)-source spanning trees., Multi-source spanning trees: Algorithms for minimizing source eccentricities., New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem, The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices, Local search algorithms for the \(k\)-cardinality tree problem., The non-approximability of bicriteria network design problems, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem