Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 6th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2003 and 7th international workshop on randomization and approximation techniques in computer science, RANDOM 2003, Princeton, NJ, USA, August 24--26, 2003. Proceedings (Q1412862)

The articles of this volume will be reviewed individually. The preceding workshops have been reviewed (see Zbl 0997.00036; Zbl 1001.00041). Indexed articles: \textit{Demaine, Erik D.; Immorlica, Nicole}, Correlation clustering with partial information, 1-13 [Zbl 1202.68479] \textit{Drake, Doratha E.; Hougardy, Stefan}, Improved linear time approximation algorithms for weighted matchings, 14-23 [Zbl 1279.68352] \textit{Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A.}, Covering graphs using trees and stars, 24-35 [Zbl 1279.68353] \textit{Fakcharoenphol, Jittat; Talwar, Kunal}, An improved decomposition theorem for graphs excluding a fixed minor, 36-46 [Zbl 1279.05053] \textit{Gandhi, Rajiv; Khuller, Samir; Srinivasan, Aravind; Wang, Nan}, Approximation algorithms for channel allocation problems in broadcast networks, 47-58 [Zbl 1279.68354] \textit{Gørtz, Inge Li; Wirth, Anthony}, Asymmetry in \(k\)-center variants, 59-70 [Zbl 1279.68355] \textit{Hall, Alex; Langkau, Katharina; Skutella, Martin}, An FPTAS for quickest multicommodity flows with inflow-dependent transit times, 71-82 [Zbl 1279.68356] \textit{Hazan, Elad; Safra, Shmuel; Schwartz, Oded}, On the complexity of approximating \(k\)-dimensional matching, 83-97 [Zbl 1279.68106] \textit{Jain, Kamal; Mahdian, Mohammad; Saberi, Amin}, Approximating market equilibria, 98-108 [Zbl 1279.91084] \textit{Könemann, Jochen; Levin, Asaf; Sinha, Amitabh}, Approximating the degree-bounded minimum diameter spanning tree problem, 109-121 [Zbl 1279.68357] \textit{Koutis, Ioannis}, On the hardness of approximate multivariate integration, 122-128 [Zbl 1279.68102] \textit{Mahdian, Mohammad; Ye, Yinyu; Zhang, Jiawei}, A \(2\)-approximation algorithm for the soft-capacitated facility location problem, 129-140 [Zbl 1279.68358] \textit{Nutov, Zeev}, Approximating rooted connectivity augmentation problems, 141-152 [Zbl 1279.68359] \textit{Sethuraman, Jay; Teo, Chung-Piaw}, Effective routing and scheduling in adversarial queueing networks, 153-164 [Zbl 1279.68032] \textit{Shachnai, Hadas; Tamir, Tami}, Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement, 165-177 [Zbl 1279.68361] \textit{Ye, Yinyu; Zhang, Jiawei}, An improved algorithm for approximating the radii of point sets, 178-187 [Zbl 1279.68362] \textit{Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Litsyn, Simon; Ron, Dana}, Testing low-degree polynomials over \(\text{GF}(2)\), 188-199 [Zbl 1247.94058] \textit{Barak, Boaz; Shaltiel, Ronen; Wigderson, Avi}, Computational analogues of entropy, 200-215 [Zbl 1279.68074] \textit{Ben-Sasson, Eli; Goldreich, Oded; Sudan, Madhu}, Bounds on \(2\)-query codeword testing, 216-227 [Zbl 1279.94142] \textit{Coja-Oghlan, Amin}, The Lovász number of random graphs, 228-239 [Zbl 1279.05066] \textit{Czumaj, Artur; Riley, Chris; Scheideler, Christian}, Perfectly balanced allocation, 240-251 [Zbl 1279.68349] \textit{Dodis, Yevgeniy; Oliveira, Roberto}, On extracting private randomness over a public channel, 252-263 [Zbl 1279.68350] \textit{Flaxman, Abraham; Frieze, Alan; Fenner, Trevor}, High degree vertices and eigenvalues in the preferential attachment graph, 264-274 [Zbl 1279.05067] \textit{Frieze, Alan; Molloy, Michael}, The satisfiability threshold for randomly generated binary constraint satisfaction problems, 275-289 [Zbl 1279.68302] \textit{Gerhardt, Heath; Watrous, John}, Continuous-time quantum walks on the symmetric group, 290-301 [Zbl 1279.81056] \textit{Halevy, Shirley; Kushilevitz, Eyal}, Distribution-free property testing, 302-317 [Zbl 1279.68105] \textit{Kaibel, Volker; Remshagen, Anja}, On the graph-density of random \(0/1\)-polytopes, 318-328 [Zbl 1279.52013] \textit{Karp, Richard M.; Kenyon, Claire}, A gambling game arising in the analysis of adaptive randomized rounding, 329-340 [Zbl 1279.68351] \textit{Kaufman, Tali; Krivelevich, Michael; Ron, Dana}, Tight bounds for testing bipartiteness in general graphs, 341-353 [Zbl 1279.05068] \textit{Kempe, Julia}, Discrete quantum walks hit exponentially faster, 354-369 [Zbl 1279.81040] \textit{Raskhodnikova, Sofya}, Approximate testing of visual properties, 370-381 [Zbl 1279.68336] \textit{Scott, Alexander D.; Sorkin, Gregory B.}, Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances, 382-395 [Zbl 1279.68108] \textit{Tarui, Jun; Itoh, Toshiya; Takei, Yoshinori}, A nearly linear size \(4\)-min-wise independent permutation family by finite geometries, 396-408 [Zbl 1279.68276]