László A. Végh

Available identifiers

zbMath Open vegh.laszlo-aMaRDI QIDQ493658

List of research outcomes

Publication	Date of Publication	Type
A Strongly Polynomial Algorithm for Linear Exchange Markets	2024-03-12	Paper
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems	2024-03-01	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix	2024-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q6147263	2024-01-15	Paper
Circuit Imbalance Measures and Linear Programming	2024-01-05	Paper
Approximating Nash social welfare under rado valuations	2023-11-14	Paper
An update-and-stabilize framework for the minimum-norm-point problem	2023-11-09	Paper
On the correlation gap of matroids	2023-11-09	Paper
An accelerated Newton-dinkelbach method and its application to two variables per inequality systems	2023-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q5875718	2023-02-03	Paper
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem	2022-12-08	Paper
On circuit diameter bounds via circuit imbalances	2022-08-16	Paper
Geometric Rescaling Algorithms for Submodular Function Minimization	2021-09-14	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix	2021-01-19	Paper
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization	2020-11-11	Paper
Rescaling Algorithms for Linear Conic Feasibility	2020-09-01	Paper
On Submodular Search and Machine Scheduling	2020-04-30	Paper
A strongly polynomial algorithm for linear exchange markets	2020-01-30	Paper
A constant-factor approximation algorithm for the asymmetric traveling salesman problem	2019-08-22	Paper
Approximating Minimum Cost Connectivity Orientation and Augmentation	2019-06-20	Paper
Signed tropical convexity	2019-06-16	Paper
Primal-dual approach for directed vertex connectivity augmentation and generalizations	2018-11-05	Paper
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation	2018-10-30	Paper
Constant factor approximation for ATSP with two edge weights	2018-10-26	Paper
A polynomial projection-type algorithm for linear programming	2018-08-27	Paper
Geometric Rescaling Algorithms for Submodular Function Minimization	2018-03-15	Paper
Approximating Minimum Cost Connectivity Orientation and Augmentation	2018-03-09	Paper
A 7/3-Approximation for Feedback Vertex Sets in Tournaments	2018-03-02	Paper
A simpler and faster strongly polynomial algorithm for generalized flow maximization	2017-08-17	Paper
A Strongly Polynomial Algorithm for Generalized Flow Maximization	2017-04-13	Paper
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives	2016-09-02	Paper
Rescaled Coordinate Descent Methods for Linear Programming	2016-08-10	Paper
Constant Factor Approximation for ATSP with Two Edge Weights	2016-08-10	Paper
Algorithms for multiplayer multicommodity flow problems	2016-06-29	Paper
The Cutting Plane Method is Polynomial for Perfect Matchings	2016-04-15	Paper
LP-based covering games with low price of anarchy	2015-09-04	Paper
A strongly polynomial algorithm for generalized flow maximization	2015-06-26	Paper
Oriented Euler complexes and signed perfect matchings	2015-04-16	Paper
To Save Or Not To Save: The Fisher Game	2015-01-07	Paper
Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs	2014-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q2921669	2014-10-13	Paper
Augmenting undirected node-connectivity by one	2014-08-13	Paper
Concave Generalized Flows with Applications to Market Equilibria	2014-07-11	Paper
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives	2014-05-13	Paper
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation	2013-08-06	Paper
The constructive characterization of \((k,l)\)-edge-connected digraphs	2011-12-20	Paper
Augmenting Undirected Node-Connectivity by One	2011-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q2999656	2011-05-16	Paper
Restricted b-Matchings in Degree-Bounded Graphs	2010-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q3617665	2009-03-30	Paper
An algorithm to increase the node-connectivity of a digraph by one	2008-11-19	Paper
Nonadaptive Selfish Routing with Online Demands	2008-04-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: László A. Végh