Lisa Fleischer

Elliot Anshelevich

Games Econ. Behav., 2015

2013

Online Mixed Packing and Covering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Online Mixed Packing and Covering

[BibT_eX]

[DOI]

CoRR, 2012

When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks.

[BibT_eX]

[DOI]

Amit Chakrabarti

Christophe Weibel

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Approximately optimal auctions for selling privacy when costs are correlated with data.

[BibT_eX]

[DOI]

Yu-Han Lyu

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Simpler sybil-proof mechanisms for multi-level marketing.

[BibT_eX]

[DOI]

Fabio Drucker

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Simple sybil-proof mechanisms for multi-level marketing.

[BibT_eX]

[DOI]

Fabio Drucker

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

2011

A competitive strategy for routing flow over time.

[BibT_eX]

[DOI]

Elliot Anshelevich

SIGecom Exch., 2011

Submodular Approximation: Sampling-based Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

Zoya Svitkina

SIAM J. Comput., 2011

Tight Approximation Algorithms for Maximum Separable Assignment Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.

[BibT_eX]

[DOI]

Zhenghui Wang

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Ordering by weighted number of wins gives a good ranking for weighted tournaments.

[BibT_eX]

[DOI]

Don Coppersmith

Atri Rudra

ACM Trans. Algorithms, 2010

Strict Cost Sharing Schemes for Steiner Forest.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses

[BibT_eX]

[DOI]

Richard Cole

Ashish Rastogi

CoRR, 2010

The Price of Collusion in Series-Parallel Networks.

[BibT_eX]

[DOI]

Chien-Chung Huang

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Preference-constrained Oriented Matching.

[BibT_eX]

[DOI]

Zoya Svitkina

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Data Center Scheduling, Generalized Flows, and Submodularity.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

Equilibria of atomic flow games are not unique.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Storage optimization for large-scale distributed stream-processing systems.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2008

A Fast and Simple Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Fast-converging tatonnement algorithms for one-time and ongoing market problems.

[BibT_eX]

[DOI]

Richard Cole

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Prompt Mechanisms for Online Auctions.

[BibT_eX]

[DOI]

Richard Cole

Shahar Dobzinski

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems.

[BibT_eX]

[DOI]

Proceedings of the Middleware 2008, 2008

2007

Quickest Flows Over Time.

[BibT_eX]

[DOI]

Martin Skutella

SIAM J. Comput., 2007

2006

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.

[BibT_eX]

[DOI]

Adam N. Letchford

Andrea Lodi

Math. Oper. Res., 2006

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems.

[BibT_eX]

[DOI]

Kamal Jain

David P. Williamson

J. Comput. Syst. Sci., 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Tight approximation algorithms for maximum general assignment problems.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Linear tolls suffice: New bounds and algorithms for tolls in single source networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.

[BibT_eX]

[DOI]

Jay Sethuraman

Math. Oper. Res., 2005

2004

A fast approximation scheme for fractional covering problems with variable upper bounds.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Further Improvements in Competitive Guarantees for QoS Buffering.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.

[BibT_eX]

[DOI]

Kamal Jain

Mohammad Mahdian

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

A push-relabel framework for submodular function minimization and applications to parametric optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Minimum cost flows over time without intermediate storage.

[BibT_eX]

[DOI]

Martin Skutella

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximately optimal control of fluid networks.

[BibT_eX]

[DOI]

Jay Sethuraman

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Networks and Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Fast and simple approximation schemes for generalized flow.

[BibT_eX]

[DOI]

Kevin D. Wayne

Math. Program., 2002

A faster capacity scaling algorithm for minimum cost submodular flow.

[BibT_eX]

[DOI]

S. Thomas McCormick

Math. Program., 2002

The Quickest Multicommodity Flow Problem.

[BibT_eX]

[DOI]

Martin Skutella

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Faster Algorithms for the Quickest Transshipment Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2001

Universally maximum flow with piecewise-constant capacities.

[BibT_eX]

[DOI]

Networks, 2001

A combinatorial strongly polynomial algorithm for minimizing submodular functions.

[BibT_eX]

[DOI]

Satoru Fujishige

J. ACM, 2001

A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem.

[BibT_eX]

[DOI]

Kamal Jain

David P. Williamson

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Optimal Rounding of Instantaneous Fractional Flows Over Time.

[BibT_eX]

[DOI]

James B. Orlin

SIAM J. Discret. Math., 2000

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.

[BibT_eX]

[DOI]

Satoru Fujishige

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved algorithms for submodular function minimization and submodular flow.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Strengthening integrality gaps for capacitated network design and covering problems.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On Identifying Strongly Connected Components in Parallel.

[BibT_eX]

[DOI]

Bruce Hendrickson

Ali Pinar

Proceedings of the Parallel and Distributed Processing, 2000

1999

Separating Maximally Violated Comb Inequalities in Planar Graphs.

[BibT_eX]

[DOI]

Éva Tardos

Math. Oper. Res., 1999

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Faster Approximation Algorithms for Generalized Flow.

[BibT_eX]

[DOI]

Kevin D. Wayne

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Efficient continuous-time dynamic network flow algorithms.

[BibT_eX]

[DOI]

Éva Tardos

Oper. Res. Lett., 1998

Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.

[BibT_eX]

[DOI]