Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
type: Item
instance of: scholarly article
title: Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
zbMATH Open document ID: 0947.00047
DOI: 10.1007/3-540-44436-X
published in: Lecture Notes in Computer Science
publication date: 2000-10-18T00:00:00Z
review text: The articles of mathematical interest will be reviewed individually. The preceding workshop (2nd, 1999) has been reviewed (see Zbl 0921.00035). Indexed articles: \textit{Arora, Sanjeev}, Approximation algorithms that take advice, 1 [Zbl 0976.68539] \textit{Hochbaum, Dorit S.}, Instant recognition of polynomial time solvability, half integrality and 2-approximations, 2-14 [Zbl 0976.90123] \textit{Möhring, Rolf H.}, Scheduling under uncertainty: Optimizing against a randomizing adversary, 15-26 [Zbl 0976.90038] \textit{Shmoys, David B.}, Approximation algorithms for facility location problems, 27-33 [Zbl 0976.68538] \textit{Ageev, Alexander; Hassin, Refael; Sviridenko, Maxim}, An approximation algorithm for MAX DICUT with given sizes of parts, 34-41 [Zbl 0976.05060] \textit{Awerbuch, Baruch; Azar, Yossi; Regev, Oded}, Maximizing job benefits on-line, 42-50 [Zbl 0976.90037] \textit{Berman, Piotr; Fukuyama, Junichiro}, Variable length sequencing with two lengths, 51-59 [Zbl 0976.68017] \textit{Auletta, Vincenzo; Caragiannis, Ioannis; Kaklamanis, Christos; Persiano, Pino}, Randomized path coloring on binary trees, 60-71 [Zbl 0976.68190] \textit{Caprara, Alberto; Italiano, Giuseppe F.; Mohan, G.; Panconesi, Alessandro; Srinivasan, Aravind}, Wavelength rerouting in optical networks, or the Venetian routing problem, 72-83 [Zbl 0976.90085] \textit{Charikar, Moses}, Greedy approximation algorithms for finding dense components in a graph, 84-95 [Zbl 0976.05062] \textit{DasGupta, Bhaskar; Palis, Michael A.}, Online real-time preemptive scheduling of jobs with deadlines, 96-107 [Zbl 0976.68015] \textit{Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark}, On the relative complexity of approximate counting problems, 108-119 [Zbl 0976.68192] \textit{Feige, Uriel; Langberg, Michael; Nissim, Kobbi}, On the hardness of approximating \({\mathcal N}{\mathcal P}\) witnesses, 120-131 [Zbl 0976.90081] \textit{Fekete, Sándor P.; Meijer, Henk}, Maximum dispersion and geom…
Mathematics Subject Classification ID: 00B25
Mathematics Subject Classification ID: 90-06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1519449
zbMATH Keywords: Saarbrücken (Germany)
zbMATH Keywords: Proceedings
zbMATH Keywords: Workshop
zbMATH Keywords: APPROX 2000
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Combinatorial optimization
MaRDI profile type: Publication
full work available at URL: 3-540-44436-x
OpenAlex ID: W2493241760
description: scientific article; zbMATH DE number 1519449