scientific article; zbMATH DE number 1947056

MaRDI QIDQ4411286zbMATH OpenFDO

Authors Refael Hassin, Asaf Levin

Publication date 7 July 2003

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Minimum restricted diameter spanning trees.
• Minimum Diameter Spanning Trees and Related Problems
• Approximating the degree-bounded minimum diameter spanning tree problem
• scientific article; zbMATH DE number 731844
• scientific article; zbMATH DE number 1003287

Cited in

(14)

• The zoo of tree spanner problems
• Vertex fusion under diameter constraints
• Minimum restricted diameter spanning trees.
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• Geometric minimum diameter minimum cost spanning tree problem
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• Approximation algorithms for quickest spanning tree problems
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
• Bounded-diameter minimum-cost graph problems
• Maintaining spanning trees of small diameter
• On two restricted ancestors tree problems
• The minimum bounded-diameter spanning forest problem is log-approximable
• Minimum spanning tree with hop restrictions
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph

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 Q4411286)