scientific article; zbMATH DE number 1330076

MaRDI QIDQ4258252zbMATH OpenFDO

Authors Vangelis Th. Paschos, Laurent Alfandari

Publication date 1 September 1999

zbMATH Keywords

polynomial time approximation algorithmreal network-designspanning-arborescence problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• On the approximability of some maximum spanning tree problems
• On the approximability of some Maximum Spanning Tree Problems
• An approximation algorithm for the maximum leaf spanning arborescence problem
• Approximating the Spanning k-Tree Forest Problem
• Approximating the spanning \(k\)-tree forest problem
• On the approximability of robust spanning tree problems
• On the SPANNING k-TREE problem
• A constructive arboricity approximation scheme
• Approximating spanning trees with few branches
• Approximating spanning trees with few branches

Cited in

(5)

• scientific article; zbMATH DE number 1629828 (Why is no real title available?)
• On the complexity of some arborescences finding problems on a multishop radio network
• Spanning cactus of a graph: Existence, extension, optimization, and approximation
• On the approximability of robust spanning tree problems
• scientific article; zbMATH DE number 3855138 (Why is no real title available?)

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