Approximation algorithms for metric tree cover and generalized tour and tree covers

DOI10.1051/ro:2007025zbMath1213.90255OpenAlexW2147562558MaRDI QIDQ3004205

Viet Hung Nguyen

Publication date: 1 June 2011

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105377

zbMATH Keywords

graph algorithmsnetwork designapproximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Cites Work

• Approximating the tree and tour covers of a graph
• Survivable networks, linear programming relaxations and the parsimonious property
• Analyzing the Held-Karp TSP bound: A monotonicity property with application
• Improved approximations for tour and tree covers
• Heuristic analysis, linear programming and branch and bound
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for metric tree cover and generalized tour and tree covers