A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations (English)
- New search for: Boyd, Sylvia
- New search for: Fu, Yao
- New search for: Sun, Yu
- New search for: Boyd, Sylvia
- New search for: Fu, Yao
- New search for: Sun, Yu
In:
Integer Programming and Combinatorial Optimization
;
186-197
;
2014
- Article/Chapter (Book) / Electronic Resource
-
Title:A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations
-
Contributors:
-
Published in:Lecture Notes in Computer Science ; 8494 ; 186-197
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2014-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
The Cycling Property for the Clutter of Odd st-WalksAbdi, Ahmad / Guenin, Bertrand et al. | 2014
- 13
-
On Simplex Pivoting Rules and Complexity TheoryAdler, Ilan / Papadimitriou, Christos / Rubinstein, Aviad et al. | 2014
- 25
-
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum CutsAissi, Hassene / Mahjoub, A. Ridha / McCormick, S. Thomas / Queyranne, Maurice et al. | 2014
- 37
-
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s TheoremAliev, Iskander / Loera, Jesús A. / Louveaux, Quentin et al. | 2014
- 52
-
Centrality of Trees for Capacitated k-CenterAn, Hyung-Chan / Bhaskara, Aditya / Chekuri, Chandra / Gupta, Shalmoli / Madan, Vivek / Svensson, Ola et al. | 2014
- 64
-
Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds ConstraintsAngulo, Alejandro / Espinoza, Daniel / Palma, Rodrigo et al. | 2014
- 76
-
On the Unique-Lifting PropertyAverkov, Gennadiy / Basu, Amitabh et al. | 2014
- 88
-
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic GraphsBaïou, Mourad / Barahona, Francisco et al. | 2014
- 102
-
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing ProblemBansal, Manish / Kianfar, Kiavash et al. | 2014
- 114
-
On the Adaptivity Gap of Stochastic OrienteeringBansal, Nikhil / Nagarajan, Viswanath et al. | 2014
- 126
-
A Utility Equivalence Theorem for Concave FunctionsBhalgat, Anand / Khanna, Sanjeev et al. | 2014
- 138
-
Network Improvement for Equilibrium RoutingBhaskar, Umang / Ligett, Katrina / Schulman, Leonard J. et al. | 2014
- 150
-
Finding Small Stabilizers for Unstable GraphsBock, Adrian / Chandrasekaran, Karthekeyan / Könemann, Jochen / Peis, Britta / Sanità, Laura et al. | 2014
- 162
-
The Triangle Splitting Method for Biobjective Mixed Integer ProgrammingBoland, Natashia / Charkhgard, Hadi / Savelsbergh, Martin et al. | 2014
- 174
-
Cut Generation through BinarizationBonami, Pierre / Margot, François et al. | 2014
- 186
-
A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using CirculationsBoyd, Sylvia / Fu, Yao / Sun, Yu et al. | 2014
- 198
-
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable UnderestimatorsBuchheim, Christoph / D’Ambrosio, Claudia et al. | 2014
- 210
-
Submodular Maximization Meets Streaming: Matchings, Matroids, and MoreChakrabarti, Amit / Kale, Sagar et al. | 2014
- 222
-
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand PairsChekuri, Chandra / Ene, Alina et al. | 2014
- 234
-
Reverse Split RankConforti, Michele / Pia, Alberto / Summa, Marco / Faenza, Yuri et al. | 2014
- 249
-
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated MachinesCorrea, José R. / Marchetti-Spaccamela, Alberto / Matuschke, Jannik / Stougie, Leen / Svensson, Ola / Verdugo, Víctor / Verschae, José et al. | 2014
- 261
-
How Good Are Sparse Cutting-Planes?Dey, Santanu S. / Molinaro, Marco / Wang, Qianyi et al. | 2014
- 273
-
Short Tours through Large Linear ForestsFeige, Uriel / Ravi, R. / Singh, Mohit et al. | 2014
- 285
-
Linear Programming Hierarchies Suffice for Directed Steiner TreeFriggstad, Zachary / Könemann, Jochen / Kun-Ko, Young / Louis, Anand / Shadravan, Mohammad / Tulsiani, Madhur et al. | 2014
- 297
-
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided TiesHuang, Chien-Chung / Kavitha, Telikepalli et al. | 2014
- 309
-
Simple Extensions of PolytopesKaibel, Volker / Walter, Matthias et al. | 2014
- 321
-
Lower Bounds on the Sizes of Integer Programs without Additional VariablesKaibel, Volker / Weltge, Stefan et al. | 2014
- 333
-
On the Configuration LP for Maximum Budgeted AllocationKalaitzis, Christos / Mądry, Aleksander / Newman, Alantha / Poláček, Lukáš / Svensson, Ola et al. | 2014
- 345
-
Two-Term Disjunctions on the Second-Order ConeKılınç-Karzan, Fatma / Yıldız, Sercan et al. | 2014
- 357
-
Coupled and k-Sided Placements: Generalizing Generalized AssignmentKorupolu, Madhukar / Meyerson, Adam / Rajaraman, Rajmohan / Tagiku, Brian et al. | 2014
- 369
-
A Unified Algorithm for Degree Bounded Survivable Network DesignLau, Lap Chi / Zhou, Hong et al. | 2014
- 381
-
Scheduling and Fixed-Parameter TractabilityMnich, Matthias / Wiese, Andreas et al. | 2014
- 393
-
Improved Branch-Cut-and-Price for Capacitated Vehicle RoutingPecin, Diego / Pessoa, Artur / Poggi, Marcus / Uchoa, Eduardo et al. | 2014
- 404
-
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial TimeBruhn, Henning / Schaudt, Oliver et al. | 2014