Laura Sanità

Math. Program., July, 2024

On the Number of Degenerate Simplex Pivots.

[BibT_eX]

[DOI]

Kirill Kukharenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Improved Approximations for Flexible Network Design.

[BibT_eX]

[DOI]

Afrouz Jabal Ameli

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Node connectivity augmentation via iterative randomized rounding.

[BibT_eX]

[DOI]

Haris Angelidakis

Math. Program., May, 2023

Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422).

[BibT_eX]

[DOI]

Jason Li

Debmalya Panigrahi

Thatchaphol Saranurak

Dagstuhl Reports, 2023

Node Connectivity Augmentation of Highly Connected Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Capacitated Network Bargaining Games: Stability and Structure.

[BibT_eX]

[DOI]

Lucy Verberk

CoRR, 2023

Stabilization of Capacitated Matching Games.

[BibT_eX]

[DOI]

Matthew Gerstbrein

Lucy Verberk

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Finding Almost Tight Witness Trees.

[BibT_eX]

[DOI]

Afrouz Jabal Ameli

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.

[BibT_eX]

[DOI]

Jesús A. De Loera

Sean Kafer

SIAM J. Optim., September, 2022

Choose your witnesses wisely.

[BibT_eX]

[DOI]

Afrouz Jabal Ameli

CoRR, 2022

2020

An efficient characterization of submodular spanning tree games.

[BibT_eX]

[DOI]

Zhuan Khye Koh

Math. Program., 2020

Stabilizing Weighted Graphs.

[BibT_eX]

[DOI]

Zhuan Khye Koh

Math. Oper. Res., 2020

On the diameter of the polytope of the stable marriage with ties.

[BibT_eX]

[DOI]

Felix Bauckholt

CoRR, 2020

2019

On the Circuit Diameter of Some Combinatorial Polytopes.

[BibT_eX]

[DOI]

Sean Kafer

Kanstantsin Pashkovich

SIAM J. Discret. Math., 2019

2018

WAOA 2015 Special Issue on TOCS.

[BibT_eX]

[DOI]

Martin Skutella

Theory Comput. Syst., 2018

Stabilizing network bargaining games by blocking players.

[BibT_eX]

[DOI]

Sara Ahmadian

Hamideh Hosseinzadeh

Math. Program., 2018

Opposite Elements in Clutters.

[BibT_eX]

[DOI]

Ahmad Abdi

Ricardo Fukasawa

Math. Oper. Res., 2018

On the approximability of the stable marriage problem with one-sided ties.

[BibT_eX]

[DOI]

Felix Bauckholt

Kanstantsin Pashkovich

CoRR, 2018

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Diameter of the Fractional Matching Polytope and Its Hardness Implications.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Algorithms for Inverse Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

0/1 Polytopes with Quadratic Chvátal Rank.

[BibT_eX]

[DOI]

Thomas Rothvoß

Oper. Res., 2017

A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.

[BibT_eX]

[DOI]

CoRR, 2017

Single-Sink Fractionally Subadditive Network Design.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Lehman's Theorem and the Directed Steiner Tree Problem.

[BibT_eX]

[DOI]

Ahmad Abdi

Andreas Emil Feldmann

Bertrand Guenin

SIAM J. Discret. Math., 2016

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Neil Olver

Math. Program., 2016

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Kanstantsin Pashkovich

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

The interval constrained 3-coloring problem.

[BibT_eX]

[DOI]

Jaroslaw Byrka

Andreas Karrenbauer

Theor. Comput. Sci., 2015

On the existence of compact ε-approximated formulations for knapsack in the original space.

[BibT_eX]

[DOI]

Yuri Faenza

Karthekeyan Chandrasekaran

Oper. Res. Lett., 2015

Finding small stabilizers for unstable graphs.

[BibT_eX]

[DOI]

Adrian Bock

Britta Peis

Math. Program., 2015

Finding the closest ultrametric.

[BibT_eX]

[DOI]

Marco Di Summa

David Pritchard

Discret. Appl. Math., 2015

The Capacitated Orienteering Problem.

[BibT_eX]

[DOI]

Adrian Bock

Discret. Appl. Math., 2015

Improved Region-Growing and Combinatorial Algorithms for <i>k</i>-Route Cut Problems (Extended Abstract).

[BibT_eX]

[DOI]

Guru Guruganesh

Mohammad Taghi Hajiaghayi

Chaitanya Swamy

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Approximate Deadline-Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Hossein Efsandiari

Proceedings of the Algorithms - ESA 2015, 2015

2014

Exponentiality of the exchange algorithm for finding another room-partitioning.

[BibT_eX]

[DOI]

Jack Edmonds

Discret. Appl. Math., 2014

Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems.

[BibT_eX]

[DOI]

Guru Guruganesh

Chaitanya Swamy

CoRR, 2014

2013

Stable Routing and Unique-Max Coloring on Trees.

[BibT_eX]

[DOI]

Nicolai Hähnle

Rico Zenklusen

SIAM J. Discret. Math., 2013

Network design with a discrete set of traffic matrices.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

Rico Zenklusen

Oper. Res. Lett., 2013

Steiner Tree Approximation via Iterative Randomized Rounding.

[BibT_eX]

[DOI]

J. ACM, 2013

On the approximability of two capacitated vehicle routing problems.

[BibT_eX]

[DOI]

Adrian Bock

Electron. Notes Discret. Math., 2013

The School Bus Problem on Trees.

[BibT_eX]

[DOI]

Algorithmica, 2013

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree.

[BibT_eX]

[DOI]

Sina Sadeghian Sadeghabad

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Better Approximation Algorithms for Technology Diffusion.

[BibT_eX]

[DOI]

Sina Sadeghian Sadeghabad

Proceedings of the Algorithms - ESA 2013, 2013

2011

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Thomas Rothvoß

Math. Oper. Res., 2011

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

An Exact Algorithm for Robust Network Design.

[BibT_eX]

[DOI]

Christoph Buchheim

Frauke Liers

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

The VPN Problem with Concave Costs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Stable routing under the Spanning Tree Protocol.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

On Finding Another Room-Partitioning of the Vertices.

[BibT_eX]

[DOI]

Jack Edmonds

Electron. Notes Discret. Math., 2010

An improved LP-based approximation for steiner tree.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

On the Complexity of the Asymmetric VPN Problem.

[BibT_eX]

[DOI]

Thomas Rothvoß