Conferences in DBLP

Randomization and Approximation Techniques in Computer Science (RANDOM) (random)
2001 (conf/random/2001)

1. Michel X. Goemans
   Using Complex Semidefinite Programming for Approximating MAX E2-LIN3. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:1- [Conf]
   
2. Russell Impagliazzo
   Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:2-5 [Conf]
   
3. Anna R. Karlin
   Web Search via Hub Synthesis. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:6- [Conf]
   
4. Luca Trevisan
   Error-Correcting Codes and Pseudorandom Projections. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:7-9 [Conf]
   
5. Salil P. Vadhan
   Order in Pseudorandomness. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:10-11 [Conf]
   
6. Susanne Albers, Carsten Witt
   Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:12-23 [Conf]
   
7. Reuven Bar-Yehuda, Dror Rawitz
   On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:24-35 [Conf]
   
8. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
   Online Weighted Flow Time and Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:36-47 [Conf]
   
9. Piotr Berman, Junichiro Fukuyama
   An Online Algorithm for the Postman Problem with a Small Penalty. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:48-54 [Conf]
   
10. Adriana Felicia Bumb, Walter Kern
    A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:55-62 [Conf]
    
11. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    Approximation Schemes for Ordered Vector Packing Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:63-74 [Conf]
    
12. Yevgeniy Dodis, Shai Halevi
    Incremental Codes. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:75-89 [Conf]
    
13. Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
    A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:90-101 [Conf]
    
14. Rahul Garg, Vijay Kumar, Vinayaka Pandit
    Approximation Algorithms for Budget-Constrained Auctions. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:102-113 [Conf]
    
15. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Minimizing Average Completion of Dedicated Tasks and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:114-126 [Conf]
    
16. Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
    A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:127-137 [Conf]
    
17. Shiro Matuura, Tomomi Matsui
    63-Approximation Algorithm for MAX DICUT. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:138-146 [Conf]
    
18. Alantha Newman
    The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:147-158 [Conf]
    
19. Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
    Some Approximation Results for the Maximum Agreement Forest Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:159-169 [Conf]
    
20. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Near-optimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:170-180 [Conf]
    
21. Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
    On a Generalized Ruin Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:181-191 [Conf]
    
22. Andreas Baltz, Tomasz Schoen, Anand Srivastav
    On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:192-201 [Conf]
    
23. Sung-woo Cho, Ashish Goel
    Exact Sampling in Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:202-210 [Conf]
    
24. Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
    On Computing Ad-hoc Selective Families. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:211-222 [Conf]
    
25. Don Coppersmith
    L Infinity Embeddings. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:223-228 [Conf]
    
26. John Dunagan, Santosh Vempala
    On Euclidean Embeddings and Bandwidth Minimization. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:229-240 [Conf]
    
27. Lars Engebretsen
    The Non-approximability of Non-Boolean Predicates. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:241-248 [Conf]
    
28. Adam Klivans
    On the Derandomization of Constant Depth Circuits. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:249-260 [Conf]
    
29. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Testing Parenthesis Languages. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:261-272 [Conf]
    
30. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Proclaiming Dictators and Juntas or Testing Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:273-284 [Conf]
    
31. Sriram V. Pemmaraju
    Equitable Coloring Extends Chernoff-Hoeffding Bounds. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:285-296 [Conf]