Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar7. RANDOM / 6. 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
- Doratha E. Drake, Stefan Hougardy:
Improved Linear Time Approximation Algorithms for Weighted Matchings. 14-23 - Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Covering Graphs Using Trees and Stars. 24-35 - Jittat Fakcharoenphol, Kunal Talwar:
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. 36-46 - Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. 47-58 - Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. 71-82 - Elad Hazan, Shmuel Safra, Oded Schwartz:
On the Complexity of Approximating k-Dimensional Matching. 83-97 - Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. 109-121 - Mohammad Mahdian, Yingyu Ye, Jiawei Zhang:
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. 129-140 - Jay Sethuraman, Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks. 153-164 - Hadas Shachnai, Tami Tamir:
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. 165-177
Contributed Talks of RANDOM
- Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(. 188-199 - Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. 264-274 - Alan M. Frieze, Michael Molloy:
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. 275-289 - Richard M. Karp, Claire Kenyon:
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. 329-340 - Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. 341-353 - Alex D. Scott, Gregory B. Sorkin:
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. 382-395 - Jun Tarui, Toshiya Itoh, Yoshinori Takei:
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. 396-408
maintained by 
, founded at 
, founded at 
last updated on 2019-02-17 19:40 CET 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:
