Browse by Discipline
Tardos, Éva - Department of Computer Science, Cornell University
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields
Facility Location with Hierarchical Facility Costs Zoya Svitkina #
Distributed Packet Switching in Arbitrary Networks Yuval Rabani \Lambda '
A Constant Factor Approximation Algorithm for a Class of Classification Problems
MinMax Multiway Cut Zoya Svitkina # and
Combinatorial Algorithms for the Generalized Circulation Problem #
The Price of Stability for Network Design with Fair Cost Allocation
Scheduling Data Transfers in a Network and the Set Scheduling Problem Ashish Goel
Near-Optimal Network Design with Sel sh Agents Elliot Anshelevich Anirban Dasgupta y
On Braess's Paradox Henry Lin # Tim Roughgarden #
The Quickest Transshipment Problem Bruce Hoppe #
A Network Pricing Game for Selfish Traffic # Ara Hayrapetyan +
Approximation algorithms for facility location (Extended Abstract)
Parallel Imaging Problem Th`anh Nguyen and Eva Tardos
Network Design for Information Networks (Extended Abstract)
We are given a graph G = (V, E) a set of facilities F # V and a set of demand points D # V . We are also given a set of resource types R and each demand point d i requires a resource of type r d i # R.
Group Strategyproof Mechanisms via PrimalDual Algorithms Martin Pal #
Approximate classification via earthmover metrics Aaron Archer
Fairness in Routing and Load Balancing Jon Kleinberg # Yuval Rabani +
Disjoint Paths in Densely Embedded Graphs Jon Kleinberg \Lambda '
Games in Networks and connections to algorithms
How Bad is Selfish Routing? Tim Roughgarden #
Maximizing the Spread of Influence through a Social David Kempe
The Effect of Collusion in Congestion Games Extended Abstract
Allocating Bandwidth for Bursty Connections Jon Kleinberg \Lambda Yuval Rabani y '
9780521872829main CUNY1061-Nisan 0 521 87282 0 May 22, 2007 14:5 Computing in Games
9780521872829main CUNY1061-Nisan 0 521 87282 0 May 23, 2007 4:25 Network Formation Games and
Approximately Maximizing Efficiency and Revenue in Polyhedral Environments
Load Balancing Without Regret in the Bulletin Board Model Robert Kleinberg
Reprint from Algorithms and Combinatorics
Bounding the Ine#ciency of Equilibria in Nonatomic Congestion Games #
Improved approximation algorithms for network design problems \Lambda M.X. Goemans y A.V. Goldberg z S.A. Plotkin x D.B. Shmoys --'
Approximation Algorithms for a Directed Network Design Problem
Mathematical Programming 62 (1993) 461-474 North-Holland
COMBINATORKA Akademiai Kiado --Springer-Verlag
Approximations for the Disjoint Paths Problem in HighDiameter Planar Networks
Website Policies/Important Links