The following pages link to László A. Végh (Q493658):
Displaying 48 items.
- (Q301119) (redirect page) (← links)
- Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
- Augmenting undirected node-connectivity by one (Q2875183) (← links)
- (Q2921669) (← links)
- Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs (Q2929700) (← links)
- To Save Or Not To Save: The Fisher Game (Q2936994) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- (Q2999656) (← links)
- Augmenting Undirected Node-Connectivity by One (Q3094939) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- Restricted b-Matchings in Degree-Bounded Graphs (Q3569807) (← links)
- (Q3617665) (← links)
- A 7/3-Approximation for Feedback Vertex Sets in Tournaments (Q4606339) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4607936) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation (Q4962187) (← links)
- Primal-dual approach for directed vertex connectivity augmentation and generalizations (Q4962713) (← links)
- A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
- A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5056450) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (Q5133966) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q5144961) (← links)
- Concave Generalized Flows with Applications to Market Equilibria (Q5169715) (← links)
- A strongly polynomial algorithm for linear exchange markets (Q5212747) (← links)
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem (Q5230290) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)
- Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (Q5326605) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q5384084) (← links)
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- (Q5875718) (← links)
- An accelerated Newton-dinkelbach method and its application to two variables per inequality systems (Q6075925) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems (Q6122568) (← links)
- A Strongly Polynomial Algorithm for Linear Exchange Markets (Q6192832) (← links)
- Signed tropical convexity (Q6320567) (← links)
