Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17--21, 2002. Proceedings (Q1848551)

The articles of mathematical interest will be reviewed individually. The preceding workshop (4th, 2001) has been reviewed (see Zbl 0969.00095). Indexed articles: \textit{Rabani, Yuval}, Search and classification of high dimensional data, 1-2 [Zbl 1013.68839] \textit{Ravi, R.}, Bicriteria spanning tree problems, 3-4 [Zbl 1013.68685] \textit{Ageev, Alexander}, Improved approximation algorithms for multilevel facility location problems, 5-13 [Zbl 1013.90116] \textit{Ahuja, Nitin; Srivastav, Anand}, On constrained hypergraph coloring and scheduling, 14-25 [Zbl 1013.90119] \textit{Angelopoulos, Spyros; Borodin, Allan}, On the power of priority algorithms for facility location and set cover, 26-39 [Zbl 1013.90120] \textit{Bläser, Markus; Manthey, Bodo}, Two approximation algorithms for 3-cycle covers, 40-50 [Zbl 1013.90123] \textit{Chakrabarti, Amit; Chekuri, Chandra; Gupta, Anupam; Kumar, Amit}, Approximation algorithms for the unsplittable flow problem, 51-66 [Zbl 1013.90112] \textit{Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M.}, 1. 5-approximation for treewidth of graphs excluding a graph with one crossing as a minor, 67-80 [Zbl 1013.90125] \textit{Doerr, Benjamin}, Typical rounding problems, 81-93 [Zbl 1013.90124] \textit{Feige, Uriel; Lovász, László; Tetali, Prasad}, Approximating min-sum set cover, 94-107 [Zbl 1013.90111] \textit{Feige, Uriel; Ofek, Eran; Wieder, Udi}, Approximating maximum edge coloring in multigraphs, 108-121 [Zbl 1013.90110] \textit{Ganapathy, Ganeshkumar; Warnow, Tandy}, Approximating the complement of the maximum compatible subset of leaves of \(k\) trees, 122-134 [Zbl 1013.90127] \textit{Giaro, Krzysztof; Janczewski, Robert; Kubale, Marek; Małafiejski, Michał}, A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs, 135-145 [Zbl 1013.90129] \textit{Gudmundsson, Joachim; Haverkort, Herman; Park, Sang-Min; Shin, Chan-Su; Wolff, Alexander}, Facility location and the geometric minimum-diameter spanning tree, 146-160 [Zbl 1013.90113] \textit{Halperin, Eran; Srinivasan, Aravind}, Improved approximation algorithms for the partial vertex cover problem, 161-174 [Zbl 1013.90117] \textit{Hassin, Refael; Levin, Asaf}, Minimum restricted diameter spanning trees, 175-184 [Zbl 1013.90118] \textit{Kortsarz, Guy; Krauthgamer, Robert; Lee, James R.}, Hardness of approximation for vertex-connectivity network-design problems, 185-199 [Zbl 1013.90114] \textit{Krumke, Sven O.; Laura, Luigi; Lipmann, Maarten; Marchetti-Spaccamela, Alberto; de Paepe, Willem E.; Poensgen, Diana; Stougie, Leen}, Non-abusiveness helps: An \(\mathcal O(1)\)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem, 200-214 [Zbl 1013.90128] \textit{Lewin-Eytan, Liane; Naor, Joseph; Orda, Ariel}, Routing and admission control in networks with advance reservations, 215-228 [Zbl 1013.90122] \textit{Mahdian, Mohammad; Ye, Yinyu; Zhang, Jiawei}, Improved approximation algorithms for metric facility location problems, 229-242 [Zbl 1013.90115] \textit{Milidiú, Ruy Luiz; Pessoa, Artur Alves; Laber, Eduardo Sany}, Complexity of makespan minimization for pipeline transportation of petroleum products, 243-255 [Zbl 1013.90126] \textit{Swamy, Chaitanya; Kumar, Amit}, Primal-dual algorithms for connected facility location problems, 256-269 [Zbl 1013.90121]