The following pages link to Éva Tardos (Q222777):
Displaying 50 items.
- (Q3140449) (← links)
- A constant factor approximation algorithm for a class of classification problems (Q3192037) (← links)
- How bad is selfish routing? (Q3196642) (← links)
- Covering directed and odd cuts (Q3220093) (← links)
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (Q3225146) (← links)
- (Q3352816) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- The Price of Stability for Network Design with Fair Cost Allocation (Q3395046) (← links)
- Approximation algorithms for classification problems with pairwise relationships (Q3455544) (← links)
- (Q3524726) (← links)
- (Q3524728) (← links)
- Parallel Imaging Problem (Q3541129) (← links)
- (Q3549713) (← links)
- Network games (Q3580980) (← links)
- Near-optimal network design with selfish agents (Q3581253) (← links)
- (Q3678944) (← links)
- Sensitivity results in integer linear programming (Q3682243) (← links)
- (Q3682499) (← links)
- (Q3688403) (← links)
- Layered Augmenting Path Algorithms (Q3734185) (← links)
- (Q3737443) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm (Q3798456) (← links)
- Note on Weintraub’s Minimum-Cost Circulation Algorithm (Q3829324) (← links)
- (Q3840368) (← links)
- How to tidy up your set-system? (Q3977426) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- Using separation algorithms in fixed dimension (Q3990616) (← links)
- (Q4011249) (← links)
- (Q4228490) (← links)
- (Q4231910) (← links)
- (Q4234048) (← links)
- (Q4263723) (← links)
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (Q4302277) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q4458883) (← links)
- (Q4471296) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- Allocating Bandwidth for Bursty Connections (Q4507345) (← links)
- (Q4526991) (← links)
- (Q4527034) (← links)
- Learning and Efficiency in Games with Dynamic Population (Q4575584) (← links)
- Separating maximally violated comb inequalities in planar graphs (Q4645943) (← links)
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents (Q4665444) (← links)
- (Q4829039) (← links)
- Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416) (← links)
- (Q4871777) (← links)
- (Q4871788) (← links)
- (Q4886085) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Information Asymmetries in Common-Value Auctions with Discrete Signals (Q5108250) (← links)