The following pages link to Éva Tardos (Q222777):
Displaying 50 items.
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- An intersection theorem for supermatroids (Q803140) (← links)
- Trading networks with price-setting agents (Q834853) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Algorithms for routing around a rectangle (Q1208452) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- (Q1306376) (redirect page) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- A faster parametric minimum-cut algorithm (Q1317480) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Simple and efficient budget feasible mechanisms for monotone submodular valuations (Q2190400) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- (Q2729096) (← links)
- Separating Maximally Violated Comb Inequalities in Planar Graphs (Q2757587) (← links)
- The Quickest Transshipment Problem (Q2757622) (← links)
- A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) (Q2819529) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q2819545) (← links)
- The curse of simultaneity (Q2826044) (← links)
- Primal-Dual-Based Algorithms for a Directed Network Design Problem (Q2890464) (← links)
- (Q2921713) (← links)
- (Q2921761) (← links)
- The effect of collusion in congestion games (Q2931373) (← links)
- Can Credit Increase Revenue? (Q2937752) (← links)
- Equilibrium in Combinatorial Public Projects (Q2937770) (← links)
- Strong Price of Anarchy, Utility Games and Coalitional Dynamics (Q2938660) (← links)
- (Q2941641) (← links)
- Frugal path mechanisms (Q2944539) (← links)
- (Q3002793) (← links)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs (Q3030579) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- Approximation Algorithms for Steiner and Directed Multicuts (Q3128195) (← links)
- (Q3128880) (← links)
- (Q3128904) (← links)
- (Q3138913) (← links)
- (Q3138915) (← links)
