The following pages link to Lisa K. Fleischer (Q233990):
Displaying 21 items.
- (Q1306375) (redirect page) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- (Q1410684) (redirect page) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- A faster capacity scaling algorithm for minimum cost submodular flow (Q1600097) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks (Q2581266) (← links)
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities (Q2706182) (← links)
- Faster Algorithms for the Quickest Transshipment Problem (Q2719247) (← links)
- Separating Maximally Violated Comb Inequalities in Planar Graphs (Q2757587) (← links)
- Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
- Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281) (← links)
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (Q2931426) (← links)
- (Q2999659) (← links)
- Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines (Q3095271) (← links)
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976) (← links)
- Improved algorithms for submodular function minimization and submodular flow (Q3191977) (← links)
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds (Q3225170) (← links)
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time (Q4939605) (← links)
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions (Q5387955) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)
