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