Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings (Q1582978)

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 geometric maximum weight cliques, 132-143 [Zbl 0976.90080] \textit{Fleischer, Rudolf; Seiden, Steve}, New results for online page replication, 144-154 [Zbl 0976.68500] \textit{Guruswami, Venkatesan}, Inapproximability results for set splitting and satisfiability problems with no mixed clauses, 155-166 [Zbl 0976.68075] \textit{Hessin, R.; Ravi, R.; Salman, F. S.}, Approximation algorithms for a capacitated network design problem, 167-176 [Zbl 0976.90013] \textit{Jain, Kamal; Vazirani, Vijay V.}, An approximation algorithm for the fault tolerant metric facility location problem, 177-183 [Zbl 0976.90056] \textit{Könemann, Jochen; Konjevod, Goran; Parekh, Ojas; Sinha, Amitabh}, Improved approximations for tour and tree covers, 184-193 [Zbl 0976.05063] \textit{Kortsarz, Guy; Nutov, Zeev}, Approximating node connectivity problems via set covers, 194-205 [Zbl 0976.05061] \textit{Loryś, Krzysztof; Paluch, Katarzyna}, Rectangle tiling, 206-213 [Zbl 0976.90084] \textit{Polzin, Tobias; Daneshmand, Siavash Vahdati}, Primal-dual approaches to the Steiner problem, 214-225 [Zbl 0976.90083] \textit{Schindelhauer, Christian}, On the inapproximability of broadcasting time. (Extended abstract), 226-237 [Zbl 0976.68501] \textit{Shachnai, Hadas; Tamir, Tami}, Polynomial time approximation schemes for class-constrained packing problems, 238-249 [Zbl 0976.90082] \textit{van Stee, Rob; La Poutré, Han}, Partial servicing of on-line jobs, 250-261 [Zbl 0976.68016] \textit{Vempala, Santosh; Vetta, Adrian}, Factor \(\frac{4}{3}\) approximations for minimum 2-connected subgraphs, 262-273 [Zbl 0976.90114]