Abstract is missing.
- The Network as a Storage Device: Dynamic Routing with Bounded BuffersStanislav Angelov, Sanjeev Khanna, Keshav Kunal. 1-13 [doi]
- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUTAdi Avidor, Uri Zwick. 14-25 [doi]
- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTsKamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar. 26-39 [doi]
- A Rounding Algorithm for Approximating Minimum Manhattan NetworksVictor Chepoi, Karim Nouioua, Yann Vaxès. 40-51 [doi]
- Packing Element-Disjoint Steiner TreesJoseph Cheriyan, Mohammad R. Salavatipour. 52-61 [doi]
- Approximating the Bandwidth of CaterpillarsUriel Feige, Kunal Talwar. 62-73 [doi]
- Where s the Winner? Max-Finding and Sorting with Metric CostsAnupam Gupta, Amit Kumar. 74-85 [doi]
- What About Wednesday? Approximation Algorithms for Multistage Stochastic OptimizationAnupam Gupta, Martin Pal, R. Ravi, Amitabh Sinha. 86-98 [doi]
- The Complexity of Making Unique Choices: Approximating 1-in- k SATVenkatesan Guruswami, Luca Trevisan. 99-110 [doi]
- Approximating the DistortionAlexander Hall, Christos H. Papadimitriou. 111-122 [doi]
- Approximating the Best-Fit Tree Under L::p:: NormsBoulos Harb, Sampath Kannan, Andrew McGregor. 123-133 [doi]
- Beating a Random AssignmentGustav Hast. 134-145 [doi]
- Scheduling on Unrelated Machines Under Tree-Like Precedence ConstraintsV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. 146-157 [doi]
- Approximation Algorithms for Network Design and Facility Location with Service CapacitiesJens Maßberg, Jens Vygen. 158-169 [doi]
- Finding Graph Matchings in Data StreamsAndrew McGregor. 170-181 [doi]
- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated GuessesJulián Mestre. 182-191 [doi]
- Efficient Approximation of Convex RecoloringsShlomo Moran, Sagi Snir. 192-208 [doi]
- Approximation Algorithms for Requirement Cut on GraphsViswanath Nagarajan, R. Ravi. 209-220 [doi]
- Approximation Schemes for Node-Weighted Geometric Steiner Tree ProblemsJan Remy, Angelika Steger. 221-232 [doi]
- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver HierarchyIannis Tourlakis. 233-244 [doi]
- Bounds for Error Reduction with Few Quantum QueriesSourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan. 245-256 [doi]
- Sampling Bounds for Stochastic OptimizationMoses Charikar, Chandra Chekuri, Martin Pál. 257-269 [doi]
- An Improved Analysis of MergersZeev Dvir, Amir Shpilka. 270-281 [doi]
- Finding a Maximum Independent Set in a Sparse Random GraphUriel Feige, Eran Ofek. 282-293 [doi]
- On the Error Parameter of DispersersRonen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma. 294-305 [doi]
- Tolerant Locally Testable CodesVenkatesan Guruswami, Atri Rudra. 306-317 [doi]
- A Lower Bound on List Size for List DecodingVenkatesan Guruswami, Salil P. Vadhan. 318-329 [doi]
- A Lower Bound for Distribution-Free Monotonicity TestingShirley Halevy, Eyal Kushilevitz. 330-341 [doi]
- On Learning Random DNF Formulas Under the Uniform DistributionJeffrey C. Jackson, Rocco A. Servedio. 342-353 [doi]
- Derandomized Constructions of k-Wise (Almost) Independent PermutationsEyal Kaplan, Moni Naor, Omer Reingold. 354-365 [doi]
- Testing PeriodicityOded Lachish, Ilan Newman. 366-377 [doi]
- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum ProblemVadim Lyubashevsky. 378-389 [doi]
- The Online Clique Avoidance Game on Random GraphsMartin Marciniszyn, Reto Spöhel, Angelika Steger. 390-401 [doi]
- A Generating Function Method for the Average-Case Analysis of DPLLRémi Monasson. 402-413 [doi]
- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT FormulasCristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi. 414-425 [doi]
- Mixing Points on a CircleDana Randall, Peter Winkler. 426-435 [doi]
- Derandomized Squaring of GraphsEyal Rozenman, Salil P. Vadhan. 436-447 [doi]
- Tight Bounds for String Reconstruction Using Substring QueriesDekel Tsur. 448-459 [doi]
- Reconstructive Dispersers and Hitting Set GeneratorsChristopher Umans. 460-471 [doi]
- The Tensor Product of Two Codes Is Not Necessarily Robustly TestablePaul Valiant. 472-481 [doi]
- Fractional Decompositions of Dense HypergraphsRaphael Yuster. 482-493 [doi]