| A Faster Scaling Algorithm for Minimizing Submodular Functions / Satoru Iwata |
| A Generalization of EdmondsÆ Matching and Matroid Intersection Algorithms / Bianca Spille ; Robert Weismantel |
| A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization / Akihisa Tamura |
| The Quickest Multicommodity Flow Problem / Lisa Fleischer ; Martin Skutella |
| A New Min-Cut Max-Flow Ratio for Multicommodity Flows / Oktay Günlük |
| Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems / Michael Lewin ; Dror Livnat ; Uri Zwick |
| Finding the Exact Integrality Gap for Small Traveling Salesman Problems / Sylvia Boyd ; Geneviève Labontè |
| Polynomial-Time Separation of Simple Comb Inequalities / Adam N. Letchford ; Andrea Lodi |
| A New Approach to Cactus Construction Applied to TSP Support Graphs / Klaus M. Wenger |
| Split Closure and Intersection Cuts / Kent Andersen ; Gérard Cornuéjols ; Yanjun Li |
| An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs / Sanjeeb Dash |
| Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms / Jean-Philippe P. Richard ; Ismael R. de Farias, Jr. ; George L. Nemhauser |
| On a Lemma of Scarf / Ron Aharoni ; Tamás Fleiner |
| A Short Proof of SeymourÆs Characterization of the Matroids with the Max-Flow Min-Cut Property / Bertrand Guenin |
| Integer Programming and Arrovian Social Welfare Functions / Jay Sethuraman ; Chung-Piaw Teo ; Rakesh V. Vohra |
| Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design / Ramamoorthi Ravi ; Amitabh Sinha |
| The Minimum Latency Problem Is NP-Hard for Weighted Trees / René Sitters |
| An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / Maxim Sviridenko |
| A Polyhedral Approach to Surface Reconstruction from Planar Contours / Ernst Althaus ; Christian Fink |
| The Semidefinite Relaxation of the k-Partition Polytope Is Strong / Andreas Eisenblätter |
| A Polyhedral Study of the Cardinality Constrained Knapsack Problem |
| A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling / Mao-Cheng Cai ; Xiaotie Deng ; Haodi Feng ; Guojun Li ; Guizhen Liu |
| An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem / Alberto Caprara ; Michele Monaci |
| On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes / Klaus Jansen ; Lorant Porkolab |
| Hard Equality Constrained Integer Knapsacks / Karen Aardal ; Arjen K. Lenstra |
| The Distribution of Values in the Quadratic Assignment Problem / Alexander Barvinok ; Tamon Stephen |
| A New Subadditive Approach to Integer Programming / Diego Klabjan |
| Improved Approximation Algorithms for Resource Allocation / Gruia Calinescu ; Amit Chakrabarti ; Howard Karloff ; Yuval Rabani |
| Approximating the Advertisement Placement Problem / Ari Freund ; Joseph Naor |
| Algorithms for Minimizing Response Time in Broadcast Scheduling / Rajiv Gandhi ; Samir Khuller ; Yoo-Ah Kim ; Yung-Chun Wan |
| Building Edge-Failure Resilient Networks / Chandra Chekuri ; Anupam Gupta ; Amit Kumar ; Danny Raz |
| The Demand Matching Problem / Bruce Shepherd ; Adrian Vetta |
| The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap / Kunal Talwar |
| Author Index |
| A Faster Scaling Algorithm for Minimizing Submodular Functions / Satoru Iwata |
| A Generalization of EdmondsÆ Matching and Matroid Intersection Algorithms / Bianca Spille ; Robert Weismantel |
| A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization / Akihisa Tamura |
図書
ＥＢ
