Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings

DOI10.1007/3-540-44436-XzbMath0947.00047OpenAlexW2493241760MaRDI QIDQ1582978

No author found.

Publication date: 18 October 2000

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44436-x

zbMATH Keywords

ProceedingsWorkshopCombinatorial optimizationApproximation algorithmsSaarbrücken (Germany)APPROX 2000

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Combinatorial optimization (90C27) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (3)

An Improved Approximation Algorithm for the Matching Augmentation Problem ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ A note on line broadcast in digraphs under the edge-disjoint paths mode

This page was built for publication: Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings