Approximation Algorithms for Scheduling Problems

Abstract

Bidding to the top : VCG and equilibria of position-based auctions p. 15 Coping with interference : from maximum coverage to planning cellular networks p. 29 Online dynamic programming speedups p. 43 Covering many or few points with unit disks p. 55 On the minimum corridor connection problem and other generalized geometric problems p. 69 Online k-server routing problems p. 83 Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem p. 95 Improved approximation bounds for edge dominating set in dense graphs p. 108 A randomized algorithm for online unit clustering p. 121 On hierarchical diameter-clustering, and the supplier problem p. 132 Bin packing with rejection revisited p. 146 On bin packing with conflicts p. 160 Approximate distance queries in disk graphs p. 174 Network design with edge-connectivity and degree constraints p. 188 Approximating maximum cut with limited unbalance p. 202 Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems p. 214 Improved online hypercube packing p. 226 Competitive online multicommodity routing p. 240 The k-allocation problem and its variants p. 253 An experimental study of the misdirection algorithm for combinatorial auctions p. 265 Reversal distance for strings with duplicates : linear time approximation using hitting set p. 279 Approximating the unweighted k-set cover problem : greedy meets local search p. 290 Approximation algorithms for multi-criteria traveling salesman problems p. 302 The survival of the weakest in networks p. 316 Online distributed object migration p. 330