Abstract is missing.
- Two O (log:::*::: k)-Approximation Algorithms for the Asymmetric k-Center ProblemAaron Archer. 1-14 [doi]
- Strongly Polynomial Algorithms for the Unsplittable Flow ProblemYossi Azar, Oded Regev. 15-29 [doi]
- Edge Covers of Setpairs and the Iterative Rounding MethodJoseph Cheriyan, Santosh Vempala. 30-44 [doi]
- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release DatesCheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi. 45-59 [doi]
- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean RelaxationFabián A. Chudak, Tim Roughgarden, David P. Williamson. 60-70 [doi]
- On the Rank of Mixed 0, 1 PolyhedraGérard Cornuéjols, Yanjun Li. 71-77 [doi]
- Fast 2-Variable Integer ProgrammingFriedrich Eisenbrand, Günter Rote. 78-89 [doi]
- Approximating k-Spanner Problems for k>2Michael Elkin, David Peleg. 90-104 [doi]
- A Matroid Generalization of the Stable Matching PolytopeTamás Fleiner. 105-114 [doi]
- A 2-Approximation for Minimum Cost {0, 1, 2} Vertex ConnectivityLisa Fleischer. 115-129 [doi]
- Combined Connectivity Augmentation and Orientation ProblemsAndrás Frank, Tamás Király. 130-144 [doi]
- An Extension of a Theorem of Henneberg and LamanAndrás Frank, László Szegö. 145-159 [doi]
- Bisubmodular Function MinimizationSatoru Fujishige, Satoru Iwata. 160-169 [doi]
- On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design ProblemNaveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II. 170-184 [doi]
- Circuit Mengerian Directed GraphsBertrand Guenin. 185-195 [doi]
- Integral Polyhedra Related to Even Cycle and Even Cut MatroidsBertrand Guenin. 196-209 [doi]
- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection ProblemsEran Halperin, Uri Zwick. 210-225 [doi]
- Synthesis of 2-Commodity Flow NetworksRefael Hassin, Asaf Levin. 226-235 [doi]
- Bounds for Deterministic Periodic Routing SequencesArie Hordijk, D. A. van der Laan. 236-250 [doi]
- Cutting Planes for Mixed 0-1 Semidefinite ProgramsGarud Iyengar, M. T. Çezik. 251-263 [doi]
- Independence Free Graphs and Vertex Connectivity AugmentationBill Jackson, Tibor Jordán. 264-279 [doi]
- The Throughput of Sequential TestingMurali S. Kodialam. 280-292 [doi]
- An Explicit Exact SDP Relaxation for Nonlinear 0-1 ProgramsJean B. Lasserre. 293-303 [doi]
- Pruning by Isomorphism in Branch-and-CutFrançois Margot. 304-317 [doi]
- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup TimesAndrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh. 318-332 [doi]
- Fences Are Futile: On Relaxations for the Linear Ordering ProblemAlantha Newman, Santosh Vempala. 333-347 [doi]
- Generating Cuts from Multiple-Term DisjunctionsMichael Perregaard, Egon Balas. 348-360 [doi]
- A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum ObjectiveMaurice Queyranne, Maxim Sviridenko. 361-369 [doi]
- Performance Guarantees of Local Search for Multiprocessor SchedulingPetra Schuurman, Tjark Vredeveld. 370-382 [doi]
- Connected Joins in GraphsAndrás Sebö, Eric Tannier. 383-395 [doi]
- Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel MachinesRené Sitters. 396-405 [doi]
- Approximation Algorithms for the Minimum Bends Traveling Salesman ProblemClifford Stein, David P. Wagner. 406-422 [doi]