scientific article; zbMATH DE number 2038709

MaRDI QIDQ4449174zbMATH OpenFDO

Authors Kevin Chang, Sanjeev Arora

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190176.htm

zbMATH Keywords

spanning tree problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximation schemes for degree-restricted MST and red-blue separation problems
• Degree-bounded minimum spanning trees
• Minimum bottleneck spanning trees with degree bounds
• Low-Degree Spanning Trees of Small Weight
• scientific article; zbMATH DE number 1263205

Cited in

(3)

• Bottleneck bichromatic full Steiner trees
• Approximation schemes for degree-restricted MST and red-blue separation problems
• On approximability of optimization problems related to red/blue-split graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449174)