Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd APPROX 2000: Saarbrücken, Germany
- Klaus Jansen, Samir Khuller:
Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1913, Springer 2000, ISBN 3-540-67996-0
Invited Talks
- Sanjeev Arora:
Approximation algorithms that take advice. 1 - Dorit S. Hochbaum:
Instant recognition of polynominal time solvability, half integrality and 2-approximations. 2-14 - Rolf H. Möhring:
Scheduling under uncertainty: Optimizing against a randomizing adversary. 15-26 - David B. Shmoys:
Approximation algorithms for facility location problems. 27-33
Contributed Talks
- Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts. 34-41 - Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. 42-50 - Piotr Berman, Junichiro Fukuyama:
Variable length sequencing with two lengths. 51-59 - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Randomized path coloring on binary trees. 60-71 - Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem. 72-83 - Moses Charikar
:
Greedy approximation algorithms for finding dense components in a graph. 84-95 - Bhaskar DasGupta, Michael A. Palis:
Online real-time preemptive scheduling of jobs with deadlines. 96-107 - Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. 108-119 - Uriel Feige, Michael Langberg, Kobbi Nissim:
On the hardness of approximating N P witnesses. 120-131 - Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. 132-143 - Rudolf Fleischer, Steven S. Seiden:
New results for online page replication. 144-154 - Venkatesan Guruswami:
Inapproximability results for set splitting and satisfiability problems with no mixed clauses. 155-166 - Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation algorithms for a capacitated network design problem. 167-176 - Kamal Jain, Vijay V. Vazirani:
An approximation algorithm for the fault tolerant metric facility location problem. 177-183 - Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved approximations for tour and tree covers. 184-193 - Guy Kortsarz, Zeev Nutov:
Approximating node connectivity problems via set covers. 194-205 - Krzysztof Lorys, Katarzyna E. Paluch:
Rectangle tiling. 206-213 - Tobias Polzin, Siavash Vahdati Daneshmand:
Primal-dual approaches to the Steiner problem. 214-225 - Christian Schindelhauer:
On the inapproximability of broadcasting time. 226-237 - Hadas Shachnai, Tami Tamir:
Polynominal time approximation schemes for class-constrained packing problem. 238-249 - Rob van Stee, Johannes A. La Poutré:
Partial servicing of on-line jobs. 250-261 - Santosh S. Vempala, Adrian Vetta:
Factor 4/3 approximations for minimum 2-connected subgraphs. 262-273
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
