Abstract is missing.
- Using Complex Semidefinite Programming for Approximating MAX E2-LIN3Michel X. Goemans. 1 [doi]
- Hill-Climbing vs. Simulated Annealing for Planted Bisection ProblemsRussell Impagliazzo. 2-5 [doi]
- Web Search via Hub SynthesisAnna R. Karlin. 6 [doi]
- Error-Correcting Codes and Pseudorandom ProjectionsLuca Trevisan. 7-9 [doi]
- Order in PseudorandomnessSalil P. Vadhan. 10-11 [doi]
- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network FlowsSusanne Albers, Carsten Witt. 12-23 [doi]
- On the Equivalence between the Primal-Dual Schema and the Local-Ratio TechniqueReuven Bar-Yehuda, Dror Rawitz. 24-35 [doi]
- Online Weighted Flow Time and Deadline SchedulingLuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. 36-47 [doi]
- An Online Algorithm for the Postman Problem with a Small PenaltyPiotr Berman, Junichiro Fukuyama. 48-54 [doi]
- A Simple Dual Ascent Algorithm for the Multilevel Facility Location ProblemAdriana Felicia Bumb, Walter Kern. 55-62 [doi]
- Approximation Schemes for Ordered Vector Packing ProblemsAlberto Caprara, Hans Kellerer, Ulrich Pferschy. 63-74 [doi]
- Incremental CodesYevgeniy Dodis, Shai Halevi. 75-89 [doi]
- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge SetGuy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov. 90-101 [doi]
- Approximation Algorithms for Budget-Constrained AuctionsRahul Garg, Vijay Kumar, Vinayaka Pandit. 102-113 [doi]
- Minimizing Average Completion of Dedicated Tasks and Interval GraphsMagnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. 114-126 [doi]
- A Greedy Facility Location Algorithm Analyzed Using Dual FittingMohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani. 127-137 [doi]
- 63-Approximation Algorithm for MAX DICUTShiro Matuura, Tomomi Matsui. 138-146 [doi]
- The Maximum Acyclic Subgraph Problem and Degree-3 GraphsAlantha Newman. 147-158 [doi]
- Some Approximation Results for the Maximum Agreement Forest ProblemEstela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi. 159-169 [doi]
- Near-optimum Universal Graphs for Graphs with Bounded DegreesNoga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. 170-180 [doi]
- On a Generalized Ruin ProblemKazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe. 181-191 [doi]
- On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment RelaxationAndreas Baltz, Tomasz Schoen, Anand Srivastav. 192-201 [doi]
- Exact Sampling in Machine Scheduling ProblemsSung-woo Cho, Ashish Goel. 202-210 [doi]
- On Computing Ad-hoc Selective FamiliesAndrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri. 211-222 [doi]
- L Infinity EmbeddingsDon Coppersmith. 223-228 [doi]
- On Euclidean Embeddings and Bandwidth MinimizationJohn Dunagan, Santosh Vempala. 229-240 [doi]
- The Non-approximability of Non-Boolean PredicatesLars Engebretsen. 241-248 [doi]
- On the Derandomization of Constant Depth CircuitsAdam Klivans. 249-260 [doi]
- Testing Parenthesis LanguagesMichal Parnas, Dana Ron, Ronitt Rubinfeld. 261-272 [doi]
- Proclaiming Dictators and Juntas or Testing Boolean FormulaeMichal Parnas, Dana Ron, Alex Samorodnitsky. 273-284 [doi]
- Equitable Coloring Extends Chernoff-Hoeffding BoundsSriram V. Pemmaraju. 285-296 [doi]