Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approx

DOI10.1007/3-540-44666-4zbMath0969.00095OpenAlexW4300561383MaRDI QIDQ5943785

No author found.

Publication date: 19 September 2001

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

Full work available at URL: https://doi.org/10.1007/3-540-44666-4

zbMATH Keywords

ProceedingsWorkshopComputer scienceAPPROX 2001Approximation algorithmsApproximation techniquesBerkeley, CA (USA)Combinatorial optimization problemsRANDOM 2001Randomization techniques

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 (1)

Sparse universal graphs for planarity

This page was built for publication: Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approx