#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1961

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lisa Fleischer
- FOCS
- 1999

We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximumâ€¦ (More)

A <i>separable assignment problem</i> (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, <i>f</i><inf><i>ij</i></inf>, for assigning item <i>j</i> to bin <i>i;</i> andâ€¦ (More)

A capacitated covering IP is an integer program of the form minf xjUx d; 0 x b; x 2 Z+g, where all entries of , U , and d are nonnegative. Given such a formulation, the ratio between the optimalâ€¦ (More)

- Zoya Svitkina, Lisa Fleischer
- 2008 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions.The new problems include submodularâ€¦ (More)

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

The survivable network design problem (SNDP) is the following problem: given an undirected graph and values rij for each pair of vertices i and j, find a minimum-cost subgraph such that there are rijâ€¦ (More)

- Joel L. Wolf, Nikhil Bansal, +5 authors Lisa Fleischer
- Middleware
- 2008

This paper describes the SODA scheduler for System S , a highly scalable distributed stream processing system. Unlike traditional batch applications, streaming applications are open-ended. The systemâ€¦ (More)

- Lisa Fleischer, Ã‰va Tardos
- Oper. Res. Lett.
- 1998

We extend the discrete-time dynamic ow algorithms presented in the literature to solve the analogous continuous-time dynamic ow problems. These problems include nding maximum dynamic ows, quickestâ€¦ (More)

- Lisa Fleischer, Bruce Hendrickson, Ali Pinar
- IPDPS Workshops
- 2000

The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm for this problem which hasâ€¦ (More)

- Don Coppersmith, Lisa Fleischer, Atri Rudra
- SODA
- 2005

We consider the following simple algorithm for feedback arc set problem in weighted tournaments --- order the vertices by their weighted indegrees. We show that this algorithm has an approximationâ€¦ (More)

- Lisa Fleischer, Kamal Jain, Mohammad Mahdian
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency to collectivelyâ€¦ (More)