Abstract is missing.
- On Nontrivial Approximation of CSPsJohan Håstad. 1 [doi]
- Analysis of Algorithms on the Cores of Random GraphsNicholas C. Wormald. 2 [doi]
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk GraphsChristoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser. 3-14 [doi]
- Approximating Precedence-Constrained Single Machine Scheduling by ColoringChristoph Ambühl, Monaldo Mastrolilli, Ola Svensson. 15-26 [doi]
- Minimizing Setup and Beam-On Times in Radiation TherapyNikhil Bansal, Don Coppersmith, Baruch Schieber. 27-38 [doi]
- On the Value of Preemption in SchedulingYair Bartal, Stefano Leonardi, Gil Shallom, René Sitters. 39-48 [doi]
- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPsBenjamin E. Birnbaum, Kenneth J. Goldman. 49-60 [doi]
- Tight Results on Minimum Entropy Set CoverJean Cardinal, Samuel Fiorini, Gwenaël Joret. 61-69 [doi]
- A Tight Lower Bound for the Steiner Point Removal Problem on TreesHubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa. 70-81 [doi]
- Single-Source Stochastic RoutingShuchi Chawla, Tim Roughgarden. 82-94 [doi]
- An ::::O::::(log::::n::::) Approximation Ratio for the Asymmetric Traveling Salesman ::::Path:::: ProblemChandra Chekuri, Martin Pál. 95-103 [doi]
- Online Algorithms to Minimize Resource Reallocations and Network CommunicationSashka Davis, Jeff Edmonds, Russell Impagliazzo. 104-115 [doi]
- Weighted Sum Coloring in Batch Scheduling of Conflicting JobsLeah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai. 116-127 [doi]
- Combinatorial Algorithms for Data Migration to Minimize Average Completion TimeRajiv Gandhi, Julián Mestre. 128-139 [doi]
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing TimesAlexander Grigoriev, Maxim Sviridenko, Marc Uetz. 140-151 [doi]
- Approximating Buy-at-Bulk and Shallow-Light ::::k::::-Steiner TreesMohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. 152-163 [doi]
- Improved Algorithms for Data MigrationSamir Khuller, Yoo Ah Kim, Azarakhsh Malekian. 164-175 [doi]
- Approximation Algorithms for Graph Homomorphism ProblemsMichael Langberg, Yuval Rabani, Chaitanya Swamy. 176-187 [doi]
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer ProblemRetsef Levi, Maxim Sviridenko. 188-199 [doi]
- Hardness of Preemptive Finite Capacity Dial-a-RideInge Li Gørtz. 200-211 [doi]
- Minimum Vehicle Routing with a Common DeadlineViswanath Nagarajan, R. Ravi. 212-223 [doi]
- Stochastic Combinatorial Optimization with Controllable Risk Aversion LevelAnthony Man-Cho So, Jiawei Zhang, Yinyu Ye. 224-235 [doi]
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity ProblemsZeev Nutov. 236-247 [doi]
- Better Approximations for the Minimum Common Integer Partition ProblemDavid P. Woodruff. 248-259 [doi]
- On Pseudorandom Generators with Linear Stretch in NC:::0:::Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. 260-271 [doi]
- A Fast Random Sampling Algorithm for Sparsifying MatricesSanjeev Arora, Elad Hazan, Satyen Kale. 272-279 [doi]
- The Effect of Boundary Conditions on Mixing Rates of Markov ChainsNayantara Bhatnagar, Sam Greenberg, Dana Randall. 280-291 [doi]
- Adaptive Sampling and Fast Low-Rank Matrix ApproximationAmit Deshpande, Santosh Vempala. 292-303 [doi]
- Robust Local Testability of Tensor Products of LDPC CodesIrit Dinur, Madhu Sudan, Avi Wigderson. 304-315 [doi]
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based MethodsPetros Drineas, Michael W. Mahoney, S. Muthukrishnan. 316-326 [doi]
- Dobrushin Conditions and Systematic ScanMartin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. 327-338 [doi]
- Complete Convergence of Message Passing Algorithms for Some Satisfiability ProblemsUriel Feige, Elchanan Mossel, Dan Vilenchik. 339-350 [doi]
- Robust MixingMurali K. Ganapathy. 351-362 [doi]
- Approximating Average Parameters of GraphsOded Goldreich, Dana Ron. 363-374 [doi]
- Local Decoding and Testing for HomomorphismsElena Grigorescu, Swastik Kopparty, Madhu Sudan. 375-385 [doi]
- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time HierarchyDan Gutfreund. 386-397 [doi]
- Randomness-Efficient Sampling Within ::::NC:::::::1:::Alexander Healy. 398-409 [doi]
- Monotone Circuits for the Majority FunctionShlomo Hoory, Avner Magen, Toniann Pitassi. 410-425 [doi]
- Space Complexity vs. Query ComplexityOded Lachish, Ilan Newman, Asaf Shapira. 426-437 [doi]
- Consistency of Local Density Matrices Is QMA-CompleteYi-Kai Liu. 438-449 [doi]
- On Bounded Distance Decoding for General LatticesYi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio. 450-461 [doi]
- Threshold Functions for Asymmetric Ramsey Properties Involving CliquesMartin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger. 462-474 [doi]
- Distance Approximation in Bounded-Degree and General Sparse GraphsSharon Marko, Dana Ron. 475-486 [doi]
- Fractional Matching Via Balls-and-BinsRajeev Motwani, Rina Panigrahy, Ying Xu 0002. 487-498 [doi]
- A Randomized Solver for Linear Systems with Exponential ConvergenceThomas Strohmer, Roman Vershynin. 499-507 [doi]
- Maintaining External Memory Efficient Hash TablesPhilipp Woelfel. 508-519 [doi]