Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications
From MaRDI portal
Publication:2476682
DOI10.1007/11671541zbMath1131.68002OpenAlexW2486816054MaRDI QIDQ2476682
No author found.
Publication date: 12 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671541
Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications