Skip to main content

Scaling Methods for Discrete and Continuous Optimization

Deliverables

Searching for OpenAIRE data...

Publications

Patchworking Oriented Matroids

Author(s): Marcel Celaya, Georg Loho, Chi Ho Yuen
Published in: arxiv report, in submission, 2020
Publisher: arxiv

Tropical Ehrhart Theory and Tropical Volume

Author(s): Georg Loho, Matthias Schymura
Published in: arxiv report, journal submission in progress, 2019
Publisher: arxiv

Face posets of tropical polyhedra and monomial ideals

Author(s): Georg Loho, Ben Smith
Published in: arxiv report, journal submission in progress, 2019
Publisher: arxiv

Tropical Carathéodory with Matroids

Author(s): Georg Loho and Raman Sanyal
Published in: arxiv report, journal submission in progress, 2019
Publisher: arxiv

A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality

Author(s): Zhuan Khye Koh, Bento Natura, László A. Végh
Published in: arxiv report, submission in progress, 2020
Publisher: arxiv

Oriented Matroids from Triangulations of Products of Simplices

Author(s): Marcel Celaya, Georg Loho, Chi Ho Yuen
Published in: arxiv report, submission in progress, 2020
Publisher: arxiv

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications

Author(s): Jugal Garg, Edin Husić, László A. Végh
Published in: arxiv report, to appear in the proceedings of STACS 2021., 2020
Publisher: arxiv

Approximating Nash Social Welfare under Rado Valuations

Author(s): Jugal Garg, Edin Husic, Laszlo A. Vegh
Published in: accepted to STOC 2021, 2021
Publisher: arxiv

A strongly polynomial algorithm for linear exchange markets

Author(s): Jugal Garg, László A. Végh
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 54-65, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316340

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Author(s): Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 761-774, ISBN 9781-450369794
Publisher: ACM
DOI: 10.1145/3357713.3384326?cid=81100084130

Signed Tropical Convexity

Author(s): Georg Loho, László A. Végh
Published in: Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 24, 2020, Page(s) 1-35
Publisher: LIPIcs–Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.itcs.2020.24

Rescaling Algorithms for Linear Conic Feasibility

Author(s): Daniel Dadush, László A. Végh, Giacomo Zambelli
Published in: Mathematics of Operations Research, 45/2, 2020, Page(s) 732-754, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2019.1011

Geometric Rescaling Algorithms for Submodular Function Minimization

Author(s): Daniel Dadush, László A. Végh, Giacomo Zambelli
Published in: Mathematics of Operations Research, (accepted), 2020, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Author(s): Neil Olver, László A. Végh
Published in: Journal of the ACM, 67/2, 2020, Page(s) 1-26, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3383454

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Author(s): Ola Svensson, Jakub Tarnawski, László A. Végh
Published in: Journal of the ACM, 67/6, 2020, Page(s) 1-53, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3424306

Directed Shortest Paths via Approximate Cost Balancing

Author(s): James B. Orlin, László A. Végh
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 235-254, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.16

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

Author(s): Daniel Dadush, Bento Natura, László A. Végh
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 931-942
Publisher: IEEE