Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
DOI10.1007/3-540-44436-XzbMATH Open0947.00047OpenAlexW2493241760MaRDI QIDQ1582978FDOQ1582978
Authors:
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
Combinatorial optimizationProceedingsWorkshopApproximation algorithmsAPPROX 2000Saarbrücken (Germany)
Combinatorial optimization (90C27) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cited In (6)
- Title not available (Why is that?)
- Approximation algorithms for combinatorial optimization. International ICALP '98 workshop, APPROX '98, Aalborg, Denmark, July 18--19, 1998. Proceedings
- Comprox III. 3rd workshop on Computation and approximation. Birmingham, GB, September 11--13, 1997
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
This page was built for publication: Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582978)
