Travelled to:1 × Canada
1 × Finland
3 × USA
Collaborated with:S.Iwata R.Cole ∅ A.Chakrabarti C.Weibel S.Fujishige J.Könemann S.Leonardi G.Schäfer N.Bansal T.Kimbrel M.Mahdian B.Schieber M.Sviridenko
Talks about:algorithm (4) submodular (3) function (2) problem (2) network (2) improv (2) minim (2) toll (2) time (2) multicommod (1)
Person: Lisa Fleischer
DBLP: Fleischer:Lisa
Contributed to:
201220082006
20042000Wrote 7 papers:
- STOC-2012-ChakrabartiFW #multi #network #problem
- When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (AC, LF, CW), pp. 19–26.
- STOC-2008-ColeF #algorithm #problem
- Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
- STOC-2006-FleischerKLS #multi #probability
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
- ICALP-2004-BansalFKMSS
- Further Improvements in Competitive Guarantees for QoS Buffering (NB, LF, TK, MM, BS, MS), pp. 196–207.
- ICALP-2004-Fleischer #algorithm #bound #linear #network
- Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks (LF), pp. 544–554.
- STOC-2000-FleischerI #algorithm
- Improved algorithms for submodular function minimization and submodular flow (LF, SI), pp. 107–116.
- STOC-2000-IwataFF #algorithm #combinator #polynomial
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (SI, LF, SF), pp. 97–106.