Lisa Fleischer

发表

Near-Optimal Design of MP S Tunnels with Shared Recovery

Aravind Srinivasan, Adam Meyerson, Iraj Saniee, 2001 .

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Satoru Iwata, Satoru Fujishige, Lisa Fleischer, 2001, JACM.

Approximating fractional multicommodity flow independent of the number of commodities

Lisa Fleischer, L. Fleischer, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

On the Uniqueness of Equilibrium in Atomic Splittable Routing Games

Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang, 2015, Math. Oper. Res..

Prompt Mechanisms for Online Auctions

Richard Cole, Shahar Dobzinski, Lisa Fleischer, 2008, SAGT.

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

Amit Chakrabarti, Lisa Fleischer, Christophe Weibel, 2012, STOC '12.

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

Lisa Fleischer, L. Fleischer, 2004, SODA '04.

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

Lisa Fleischer, 2001, IPCO.

Online Mixed Packing and Covering

Yossi Azar, Debmalya Panigrahi, Umang Bhaskar, 2012, SODA.

Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks

Lisa Fleischer, 2004, ICALP.

Quickest Flows Over Time

Martin Skutella, Lisa Fleischer, L. Fleischer, 2007, SIAM J. Comput..

Further Improvements in Competitive Guarantees for QoS Buffering

Baruch Schieber, Nikhil Bansal, Tracy Kimbrel, 2004, ICALP.

Minimum cost flows over time without intermediate storage

Martin Skutella, Lisa Fleischer, L. Fleischer, 2003, SODA '03.

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

Lisa Fleischer, 1998, IPCO.

Equilibria of atomic flow games are not unique

Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang, 2009, SODA.

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

Lisa Fleischer, Zoya Svitkina, 2011, SIAM J. Comput..

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

Richard Cole, Lisa Fleischer, Ashish Rastogi, 2010, ArXiv.

Strengthening integrality gaps for capacitated network design and covering problems

Robert D. Carr, Cynthia A. Phillips, Lisa Fleischer, 2000, SODA '00.

Faster approximation algorithms for generalized flow

Lisa Fleischer, Kevin D. Wayne, 1999, SODA '99.

Universally maximum flow with piecewise‐constant capacities

Lisa Fleischer, L. Fleischer, 2001, Networks.

A Fast and Simple Algorithm for Computing Market Equilibria

Amin Saberi, Rahul Garg, Lisa Fleischer, 2008, WINE.

Preference-constrained Oriented Matching

Lisa Fleischer, Zoya Svitkina, 2010, ANALCO.

Sensor Placement in Municipal Water Networks

Cynthia A. Phillips, Jonathan W. Berry, William E. Hart, 2003 .

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

Satoru Iwata, Lisa Fleischer, L. Fleischer, 2003, Discret. Appl. Math..

Recent Progress in Submodular Function Minimization

Lisa Fleischer, L. Fleischer, 2000 .

Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface

Kirk Pruhs, Sudipto Guha, Haim Kaplan, 2005, ACM-SIAM Symposium on Discrete Algorithms.

Faster algorithms for the quickest transshipment problem with zero transit times

Lisa Fleischer, 1998, SODA '98.

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

Satoru Iwata, Satoru Fujishige, Lisa Fleischer, 2000, STOC '00.

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

Atri Rudra, Don Coppersmith, Lisa Fleischer, 2006, SODA '06.

Separating Maximally Violated Comb Inequalities in Planar Graphs

Éva Tardos, Lisa Fleischer, 1996, IPCO.

Optimal Rounding of Instantaneous Fractional Flows Over Time

James B. Orlin, Lisa Fleischer, 2000, SIAM J. Discret. Math..

Fast and simple approximation schemes for generalized flow

Lisa Fleischer, Kevin D. Wayne, L. Fleischer, 2002, Math. Program..

Strict Cost Sharing Schemes for Steiner Forest

Jochen Könemann, Stefano Leonardi, Guido Schäfer, 2010, SIAM J. Comput..

Universally Maximum Flow with Piecewise-Constant Capacities

Lisa Fleischer, L. Fleischer, 1999, IPCO.

IBM Research Report Quickest Flows Over Time

Martin Skutella, Lisa Fleischer, L. Fleischer, 2003 .

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

Lisa Fleischer, 1999, J. Algorithms.

An iterative rounding 2-approximation algorithm for the element connectivity problem

David P. Williamson, Kamal Jain, Lisa Fleischer, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

Lisa Fleischer, Zhenghui Wang, 2011, SAGT.

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

Richard Cole, Lisa Fleischer, R. Cole, 2008, STOC.

Routing games

Umang Bhaskar, Lisa Fleischer, L. Fleischer, 2012 .

Separating Maximally Violated Comb Inequalities in Planar Graphs

Éva Tardos, Lisa Fleischer, 1999, Math. Oper. Res..

Scheduling parallelizable tasks to minimize average response time

Philip S. Yu, Uwe Schwiegelshohn, John Turek, 1994, SPAA '94.

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

Yu-Han Lyu, Lisa Fleischer, L. Fleischer, 2012, EC '12.

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

Jochen Könemann, Stefano Leonardi, Guido Schäfer, 2006, STOC '06.

Data Center Scheduling, Generalized Flows, and Submodularity

Lisa Fleischer, 2010, ANALCO.

A Stackelberg strategy for routing flow over time

Elliot Anshelevich, Umang Bhaskar, Lisa Fleischer, 2010, SODA '11.

Session details: Session 2A

Lisa Fleischer, 2011, STOC '11.

A competitive strategy for routing flow over time

Elliot Anshelevich, Umang Bhaskar, Lisa Fleischer, 2011, SECO.

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

Lisa Fleischer, Jay Sethuraman, J. Sethuraman, 2005, Math. Oper. Res..

Storage Optimization for Large-Scale Distributed Stream Processing Systems

Philip S. Yu, Joel L. Wolf, Fred Douglis, 2007, IPDPS.

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011

Tim Roughgarden, Shuchi Chawla, Jason D. Hartline, 2015, Games Econ. Behav..

A Simple and Efficient Algorithm for Computing Market Equilibria

Amin Saberi, Rahul Garg, Lisa Fleischer, 2016, ACM Trans. Algorithms.

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

Lisa Fleischer, L. Fleischer, 2005, Theor. Comput. Sci..

Algorithms and Lower Bounds for Submodular Cuts and Approximating Submodular Functions (Combinatorial Optimization and Discrete Algorithms)

Lisa Fleischer, Zoya Svitkina, L. Fleischer, 2010 .

A faster capacity scaling algorithm for minimum cost submodular flow

Satoru Iwata, S. Thomas McCormick, Lisa Fleischer, 2002, Math. Program..

Approximately optimal control of fluid networks

Lisa Fleischer, Jay Sethuraman, J. Sethuraman, 2003, SODA '03.

Optimal Coordination Mechanisms for Unrelated Machine Scheduling

Yossi Azar, Vahab S. Mirrokni, Kamal Jain, 2015, Oper. Res..

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

Kun-Lung Wu, Nikhil Bansal, Joel L. Wolf, 2008, Middleware.

Simple sybil-proof mechanisms for multi-level marketing

Lisa Fleischer, Fabio Drucker, Fabio Drucker, 2012, 2012 Proceedings IEEE INFOCOM Workshops.

Simple sybil-proof mechanisms for multi-level marketing

Lisa Fleischer, Fabio Drucker, 2012, INFOCOM Workshops.

Tight approximation algorithms for maximum general assignment problems

Vahab S. Mirrokni, Michel X. Goemans, Maxim Sviridenko, 2006, SODA '06.

A Divide-and-conquer Algorithm for Identifying Strongly Connected Components ?

Bruce Hendrickson, Ali Pinar, Don Coppersmith, 2003 .

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Andrea Lodi, Adam N. Letchford, Lisa Fleischer, 2006, Math. Oper. Res..

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

Lisa Fleischer, L. Fleischer, 2000, SIAM J. Discret. Math..

The Quickest Multicommodity Flow Problem

Martin Skutella, Lisa Fleischer, L. Fleischer, 2002, IPCO.

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

David P. Williamson, Kamal Jain, Lisa Fleischer, 2006, J. Comput. Syst. Sci..

Faster Algorithms for the Quickest Transshipment Problem

Lisa Fleischer, L. Fleischer, 2001, SIAM J. Optim..

The Price of Collusion in Series-Parallel Networks

Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang, 2010, IPCO.

Improved algorithms for submodular function minimization and submodular flow

Satoru Iwata, Lisa Fleischer, L. Fleischer, 2000, STOC '00.

Networks And Flows

David Simchi-Levi, Douglas R. Shier, Clifford Stein, 1999, Handbook of Discrete and Combinatorial Mathematics.

Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games

Mohammad Mahdian, Kamal Jain, Lisa Fleischer, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Storage Optimization for Large-Scale Distributed Stream Processing Systems

Philip S. Yu, Joel L. Wolf, Fred Douglis, 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

Lisa Fleischer, Zoya Svitkina, L. Fleischer, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Efficient continuous-time dynamic network flow algorithms

Éva Tardos, Lisa Fleischer, L. Fleischer, 1998, Oper. Res. Lett..

Impact of the COVID-19 Crisis on Digital Business Models - Contactless Payments

Lisa Fleischer, Ralf-Christian Härting, Kevin Bilge, 2021, KES-AMSTA.

Tight Approximation Algorithms for Maximum Separable Assignment Problems

Vahab S. Mirrokni, Michel X. Goemans, Maxim Sviridenko, 2019 .

Optimal Rounding of Fractional Dynamic Flows when Transit Times are Zero

James B. Orlin, Lisa Fleischer, J. Orlin, 1997 .

A Scalable Algorithm for the Minimum Expected Cost Restorable Flow Problem

Aravind Srinivasan, Adam Meyerson, Iraj Saniee, 2003 .