List of accepted papers for APPROX 2003:


Covering Graphs using Trees and Stars
"G. Even and N. Garg and J. Konemann and R. Ravi and A. Sinha"

Asymmetry in k-Center Variants
"Inge Li Goertz and Anthony Wirth"

Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement
"Hadas Shachnai and Tami Tamir"

Improved Linear Time Approximation Algorithms for Weighted Matchings
"Doratha E. Drake and Stefan Hougardy"

Effective Routing and Scheduling in Adversarial Queueing Networks
"Jay Sethuraman and Chung-Piaw Teo"

An Improved Algorithm for Approximating the Radii of Point Sets
"Yinyu Ye and Jiawei Zhang"

On the hardness of approximate multivariate integration
"Ioannis Koutis"

Approximating the Degree-Bounded Minimum-Diameter Spanning Tree Problem
"J. Konemann and A. Levin and A. Sinha"

Improved decompositions of graphs with forbidden minors
"Jittat Fakcharoenphol and Kunal Talwar"

An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
"Alex Hall and Katharina Langkau and Martin Skutella"

A 2-approximation algorithm for the soft-capacitated facility location problem
"Mohammad Mahdian and Yinyu Ye and Jiawei Zhang"

Approximating Market Equilibria
"Kamal Jain and Mohammad Mahdian and Amin Saberi"

Correlation Clustering with Partial Information
"Demaine, Erik D. and Immorlica, Nicole"

On the Hardness of Approximating $k$-Dimensional Matching
"Elad Hazan and Shmuel Safra and Oded Schwartz"

Approximating rooted connectivity augmentation problems
"Zeev Nutov"

Approximation algorithms for channel allocation problems in broadcast networks
"Rajiv Gandhi and Samir Khuller and Aravind Srinivasan and Nan Wang"