The following pages link to Sven O. Krumke (Q324813):
Displayed 50 items.
- Item:Q324813 (redirect page) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Budget-constrained minimum cost flows (Q281825) (← links)
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Robust optimization for routing problems on trees (Q301384) (← links)
- On the online min-wait relocation problem (Q324815) (← links)
- The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
- Selfish bin coloring (Q411255) (← links)
- Erratum to ``Minimum cost flows with minimum quantities'' (Q436590) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines (Q632642) (← links)
- Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization (Q639359) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Rejoinder on: ``Static and dynamic source locations in undirected networks'' (Q889103) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Pruning in column generation for service vehicle dispatching (Q940899) (← links)
- Approximation algorithms for a vehicle routing problem (Q953301) (← links)
- Bincoloring (Q954994) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- Semi-preemptive routing on trees (Q1003476) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Approximation algorithms for certain network improvement problems (Q1282208) (← links)
- Compact location problems (Q1391322) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Item:Q324813 (redirect page) (← links)
- On the minimum label spanning tree problem (Q1567494) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Minimum cost flows with minimum quantities (Q1944944) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (Q2050253) (← links)
- Algorithms and complexity for the almost equal maximum flow problem (Q2050270) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← links)
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Robust absolute single machine makespan scheduling-location problem on trees (Q2294524) (← links)
- Convex generalized flows (Q2352786) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Full implementation of social choice functions in dominant strategies (Q2424248) (← links)
- Generalized max flow in series-parallel graphs (Q2445843) (← links)
- Reoptimization gaps versus model errors in online-dispatching of service units for ADAC (Q2500538) (← links)