Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Fleischer, Lisa K. - Department of Computer Science, Dartmouth College
Ordering by weighted number of wins gives a good ranking for weighted tournaments
Submodular Approximation: Sampling-Based Algorithms and Lower Bounds Zoya Svitkina Lisa Fleischer
Simple Cost Sharing Schemes for Multicommodity Rent-or-Buy and Stochastic Steiner Tree
Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games
A push-relabel framework for submodular function minimization and applications to
A Combinatorial Strongly Polynomial Algorithm for Minimizing Submodular Functions
A Fast Approximation Scheme for Fractional Covering Problems with Box Constraints
APPROXIMATING FRACTIONAL MULTICOMMODITY FLOW INDEPENDENT OF THE NUMBER OF COMMODITIES
Equilibria of Atomic Flow Games are not Unique Umang Bhaskar
A Fast Approximation Scheme for Fractional Covering Problems with Box Constraints
The Price of Collusion in Series-Parallel Umang Bhaskar1
Quickest Flows Over Time Lisa Fleischer
A Combinatorial Strongly Polynomial Algorithm for Minimizing Submodular Functions
Fast-Converging Tatonnement Algorithms for One-Time and Ongoing Market Problems
A Faster Capacity Scaling Algorithm for Minimum Cost Submodular Flow
A Scalable Algorithm for the Minimum Expected Cost Restorable Flow Problem
Minimum Cost Flows Over Time without Intermediate Storage Lisa Fleischer
Tight Approximation Algorithms for Maximum General Assignment Lisa Fleischer
A Fast and Simple Algorithm for Computing Market Equilibria
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
OPTIMAL ROUNDING OF INSTANTANEOUS FRACTIONAL FLOWS OVER TIME
Fast and Simple Approximation Schemes for Generalized Flow Lisa K. Fleischer y Kevin D. Wayne z
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 30, No. 4, November 2005, pp. 916938
Digital Object Identifier (DOI) 10.1007/s101070100238 Math. Program., Ser. A (2001)
Prompt Mechanisms for Online Auctions Richard Cole1
Further Improvements in Competitive Guarantees for QoS Buffering
Iterative Rounding 2Approximation Algorithms for MinimumCost Vertex Connectivity Problems
Iterative Rounding 2-Approximation Algorithms for Minimum-Cost Vertex Connectivity Problems
A Faster Capacity Scaling Algorithm for Minimum Cost Submodular Flow
A Scalable Algorithm for the Minimum Expected Cost Restorable Flow Problem
Linear Tolls Suce: New bounds and algorithms for tolls
The Quickest Multicommodity Flow Problem ? Lisa Fleischer 1 and Martin Skutella 2
APPROXIMATING FRACTIONAL MULTICOMMODITY FLOW INDEPENDENT OF THE NUMBER OF COMMODITIES \Lambda
A push-relabel framework for submodular function minimization and applications to
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No. 3, August 2011, pp. 416431