7. RANDOM / 6. APPROX 2003:
Princeton University,
NY,
USA
Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai (Eds.):
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, NY, USA, August 24-26, 2003, Proceedings.
Lecture Notes in Computer Science 2764 Springer 2003, ISBN 3-540-40770-7 BibTeX
@proceedings{DBLP:conf/random/2003,
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'e} D. P. Rolim and
Amit Sahai},
title = {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, NY, USA,
August 24-26, 2003, Proceedings},
booktitle = {RANDOM-APPROX},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2764},
year = {2003},
isbn = {3-540-40770-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Contributed Talks of APPROX
- Erik D. Demaine, Nicole Immorlica:
Correlation Clustering with Partial Information.
1-13
Electronic Edition (link) BibTeX
- Doratha E. Drake, Stefan Hougardy:
Improved Linear Time Approximation Algorithms for Weighted Matchings.
14-23
Electronic Edition (link) BibTeX
- Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Covering Graphs Using Trees and Stars.
24-35
Electronic Edition (link) BibTeX
- Jittat Fakcharoenphol, Kunal Talwar:
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.
36-46
Electronic Edition (link) BibTeX
- Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.
47-58
Electronic Edition (link) BibTeX
- Inge Li Gørtz, Anthony Wirth:
Asymmetry in k-Center Variants.
59-70
Electronic Edition (link) BibTeX
- Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
71-82
Electronic Edition (link) BibTeX
- Elad Hazan, Shmuel Safra, Oded Schwartz:
On the Complexity of Approximating k-Dimensional Matching.
83-97
Electronic Edition (link) BibTeX
- Kamal Jain, Mohammad Mahdian, Amin Saberi:
Approximating Market Equilibria.
98-108
Electronic Edition (link) BibTeX
- Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
109-121
Electronic Edition (link) BibTeX
- Ioannis Koutis:
On the Hardness of Approximate Multivariate Integration.
122-128
Electronic Edition (link) BibTeX
- Mohammad Mahdian, Yingyu Ye, Jiawei Zhang:
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.
129-140
Electronic Edition (link) BibTeX
- Zeev Nutov:
Approximating Rooted Connectivity Augmentation Problems.
141-152
Electronic Edition (link) BibTeX
- Jay Sethuraman, Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks.
153-164
Electronic Edition (link) BibTeX
- Hadas Shachnai, Tami Tamir:
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.
165-177
Electronic Edition (link) BibTeX
- Yingyu Ye, Jiawei Zhang:
An Improved Algorithm for Approximating the Radii of Point Sets.
178-187
Electronic Edition (link) BibTeX
Contributed Talks of RANDOM
- Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(.
188-199
Electronic Edition (link) BibTeX
- Boaz Barak, Ronen Shaltiel, Avi Wigderson:
Computational Analogues of Entropy.
200-215
Electronic Edition (link) BibTeX
- Eli Ben-Sasson, Oded Goldreich, Madhu Sudan:
Bounds on 2-Query Codeword Testing.
216-227
Electronic Edition (link) BibTeX
- Amin Coja-Oghlan:
The Lovász Number of Random Graphs.
228-239
Electronic Edition (link) BibTeX
- Artur Czumaj, Chris Riley, Christian Scheideler:
Perfectly Balanced Allocation.
240-251
Electronic Edition (link) BibTeX
- Yevgeniy Dodis, Roberto Oliveira:
On Extracting Private Randomness over a Public Channel.
252-263
Electronic Edition (link) BibTeX
- Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.
264-274
Electronic Edition (link) BibTeX
- Alan M. Frieze, Michael Molloy:
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems.
275-289
Electronic Edition (link) BibTeX
- Heath Gerhardt, John Watrous:
Continuous-Time Quantum Walks on the Symmetric Group.
290-301
Electronic Edition (link) BibTeX
- Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Property Testing.
302-317
Electronic Edition (link) BibTeX
- Volker Kaibel, Anja Remshagen:
On the Graph-Density of Random 0/1-Polytopes.
318-328
Electronic Edition (link) BibTeX
- Richard M. Karp, Claire Kenyon:
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding.
329-340
Electronic Edition (link) BibTeX
- Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs.
341-353
Electronic Edition (link) BibTeX
- Julia Kempe:
Discrete Quantum Walks Hit Exponentially Faster.
354-369
Electronic Edition (link) BibTeX
- Sofya Raskhodnikova:
Approximate Testing of Visual Properties.
370-381
Electronic Edition (link) BibTeX
- Alex D. Scott, Gregory B. Sorkin:
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.
382-395
Electronic Edition (link) BibTeX
- Jun Tarui, Toshiya Itoh, Yoshinori Takei:
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries.
396-408
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:35:37 2009
by Michael Ley (ley@uni-trier.de)