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