
Conferences in DBLP
 Michel X. Goemans
Using Complex Semidefinite Programming for Approximating MAX E2LIN3. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:1 [Conf]
 Russell Impagliazzo
HillClimbing vs. Simulated Annealing for Planted Bisection Problems. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:25 [Conf]
 Anna R. Karlin
Web Search via Hub Synthesis. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:6 [Conf]
 Luca Trevisan
ErrorCorrecting Codes and Pseudorandom Projections. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:79 [Conf]
 Salil P. Vadhan
Order in Pseudorandomness. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:1011 [Conf]
 Susanne Albers, Carsten Witt
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:1223 [Conf]
 Reuven BarYehuda, Dror Rawitz
On the Equivalence between the PrimalDual Schema and the LocalRatio Technique. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:2435 [Conf]
 Luca Becchetti, Stefano Leonardi, Alberto MarchettiSpaccamela, Kirk Pruhs
Online Weighted Flow Time and Deadline Scheduling. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:3647 [Conf]
 Piotr Berman, Junichiro Fukuyama
An Online Algorithm for the Postman Problem with a Small Penalty. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:4854 [Conf]
 Adriana Felicia Bumb, Walter Kern
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:5562 [Conf]
 Alberto Caprara, Hans Kellerer, Ulrich Pferschy
Approximation Schemes for Ordered Vector Packing Problems. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:6374 [Conf]
 Yevgeniy Dodis, Shai Halevi
Incremental Codes. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:7589 [Conf]
 Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
A 3/2Approximation Algorithm for Augmenting the EdgeConnectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:90101 [Conf]
 Rahul Garg, Vijay Kumar, Vinayaka Pandit
Approximation Algorithms for BudgetConstrained Auctions. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:102113 [Conf]
 Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:114126 [Conf]
 Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:127137 [Conf]
 Shiro Matuura, Tomomi Matsui
63Approximation Algorithm for MAX DICUT. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:138146 [Conf]
 Alantha Newman
The Maximum Acyclic Subgraph Problem and Degree3 Graphs. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:147158 [Conf]
 Estela Maris Rodrigues, MarieFrance Sagot, Yoshiko Wakabayashi
Some Approximation Results for the Maximum Agreement Forest Problem. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:159169 [Conf]
 Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Nearoptimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:170180 [Conf]
 Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
On a Generalized Ruin Problem. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:181191 [Conf]
 Andreas Baltz, Tomasz Schoen, Anand Srivastav
On the bPartite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:192201 [Conf]
 Sungwoo Cho, Ashish Goel
Exact Sampling in Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:202210 [Conf]
 Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
On Computing Adhoc Selective Families. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:211222 [Conf]
 Don Coppersmith
L Infinity Embeddings. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:223228 [Conf]
 John Dunagan, Santosh Vempala
On Euclidean Embeddings and Bandwidth Minimization. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:229240 [Conf]
 Lars Engebretsen
The Nonapproximability of NonBoolean Predicates. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:241248 [Conf]
 Adam Klivans
On the Derandomization of Constant Depth Circuits. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:249260 [Conf]
 Michal Parnas, Dana Ron, Ronitt Rubinfeld
Testing Parenthesis Languages. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:261272 [Conf]
 Michal Parnas, Dana Ron, Alex Samorodnitsky
Proclaiming Dictators and Juntas or Testing Boolean Formulae. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:273284 [Conf]
 Sriram V. Pemmaraju
Equitable Coloring Extends ChernoffHoeffding Bounds. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:285296 [Conf]
