Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Fleischer, Lisa"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
When the cut condition is enough: A complete characterization for multiflow problems in series-parallel networks
Amit Chakrabarti
,
Lisa Fleischer
,
Christophe Weibel
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 19-26
Submodular approximation: Sampling-based algorithms and lower bounds
Zoya Svitkina
,
Lisa Fleischer
SIAM Journal on Computing
40
(6), 2011, pp. 1715-1737
The price of collusion in series-parallel networks
Umang Bhaskar
,
Lisa Fleischer
,
Chien-Chung Huang
Lecture Notes in Computer Science
6080
, 2010, pp. 313-326
Strict cost sharing schemes for Steiner forest
Lisa Fleischer
,
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
SIAM Journal on Computing
39
(8), 2010, pp. 3616-3632
Fast-converging tatonnement algorithms for one-time and ongoing market problems
Richard Cole
,
Lisa Fleischer
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 315-324
Quickest flows over time
Lisa Fleischer
,
Martin Skutella
SIAM Journal on Computing
36
(6), 2007, pp. 1600-1630
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Lisa Fleischer
,
Kamal Jain
,
David P. Williamson
Journal of Computer and System Sciences
72
(5), 2006, pp. 838-867
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Lisa Fleischer
,
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 663-670
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
Lisa Fleischer
Theoretical Computer Science
348
(2-3), 2005, pp. 217-225
Further improvements in competitive guarantees for QoS buffering
Nikhil Bansal
,
Lisa K. Fleischer
,
Tracy Kimbrel
,
Mohammad Mahdian
,
Baruch Schieber
,
Maxim Sviridenko
Lecture Notes in Computer Science
3142
, 2004, pp. 196-207
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
Lisa Fleischer
Lecture Notes in Computer Science
3142
, 2004, pp. 544-554
The quickest multicommodity flow problem
Lisa Fleischer
,
Martin Skutella
Lecture Notes in Computer Science
2337
, 2002, pp. 36-53
A 2-approximation for minimum cost 0,1,2 vertex connectivity
Lisa Fleischer
Lecture Notes in Computer Science
2081
, 2001, pp. 115-129
Universally maximum flow with piecewise-constant capacities
Lisa K. Fleischer
Networks
38
(3), 2001, pp. 115-125
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Satoru Iwata
,
Lisa Fleischer
,
Satoru Fujishige
Journal of the ACM
48
(4), 2001, pp. 761-777
Improved algorithms for submodular function minimization and submodular flow
Lisa Fleischer
,
Satoru Iwata
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 107-116
Optimal rounding of instantaneous fractional flows over time
Lisa Fleischer
,
James B. Orlin
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 145-153
Approximating fractional multicommodity flow independent of the number of commodities
Lisa K. Fleischer
SIAM Journal on Discrete Mathematics
13
(4), 2000, pp. 505-520
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Satoru Iwata
,
Lisa Fleischer
,
Satoru Fujishige
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 97-106
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
Lisa Fleischer
Journal of Algorithms
33
(1), 1999, pp. 51-72
Universally maximum flow with piecewise-constant capacities
Lisa Fleischer
Lecture Notes in Computer Science
1610
, 1999, pp. 151-165
Faster approximation algorithms for generalized flow
Kevin D. Wayne
,
Lisa Fleischer
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 981-982
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
Lisa Fleischer
Lecture Notes in Computer Science
1412
, 1998, pp. 294-309
Separating maximally violated comb inequalities in planar graphs
Lisa Fleischer
,
Éva Tardos
Lecture Notes in Computer Science
1084
, 1996, pp. 475-489
Scheduling parallelizable tasks to minimize average response time
John Turek
,
Walter Ludwig
,
Joel L. Wolf
,
Lisa Fleischer
,
Prasoon Tiwari
,
Jason Glasgow
,
Uwe Schwiegelshohn
,
Philip S. Yu
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 200-209