The following pages link to Martin Skutella (Q6479077):
Displaying 1 item.
- (Q408431) (redirect page) (← links)
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Earliest arrival flows in networks with multiple sinks (Q496688) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- Continuous and discrete flows over time (Q634790) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- The \(k\)-splittable flow problem (Q818654) (← links)
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria (Q826114) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times (Q878444) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- A short proof of the VPN tree routing conjecture on ring networks (Q943799) (← links)
- Single-source \(k\)-splittable min-cost flows (Q1015297) (← links)
- Multiline addressing by network flow (Q1016524) (← links)
- The complexity of economic equilibria for house allocation markets (Q1029018) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Preemptive scheduling with rejection (Q1411622) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Stable flows over time (Q1736580) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- A tight bound on the speed-up through storage for quickest multi-commodity flows (Q1785329) (← links)
- Approximating the single source unsplittable min-cost flow problem (Q1849529) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Single source unsplittable flows with arc-wise lower and upper bounds (Q2118142) (← links)
- Paths to stable allocations (Q2329415) (← links)
- Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
- Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
- On the complexity of instationary gas flows (Q2417151) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency (Q2638384) (← links)
- A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs (Q2670439) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- (Q2723565) (← links)
- (Q2753942) (← links)
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem (Q2757572) (← links)
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines (Q2757623) (← links)
- (Q2768404) (← links)
- Single Machine Scheduling with Release Dates (Q2784510) (← links)
- A Note on the Ring Loading Problem (Q2790401) (← links)
- PolySCIP (Q2819226) (← links)
- A PTAS for minimizing the weighted sum of job completion times on parallel machines (Q2819573) (← links)
- Earliest Arrival Flows in Networks with Multiple Sinks (Q2883623) (← links)
- Generalized Maximum Flows over Time (Q2896394) (← links)
- Universal Sequencing on an Unreliable Machine (Q2910853) (← links)
- Maximum Multicommodity Flows over Time without Intermediate Storage (Q2912872) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)
- Paths to Stable Allocations (Q2938646) (← links)
- Graph Orientation and Flows over Time (Q2942675) (← links)
- Stochastic Scheduling on Unrelated Machines (Q2965523) (← links)
- An Introduction to Network Flows over Time (Q2971621) (← links)
- An FPTAS for Flows over Time with Aggregate Arc Capacities (Q3075454) (← links)
- Online Scheduling with Bounded Migration (Q3169046) (← links)
- Earliest Arrival Flows with Multiple Sources (Q3169047) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615) (← links)
- (Q3304142) (← links)
- Graph orientation and flows over time (Q4642437) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Algorithmic results for potential‐based flows: Easy and hard cases (Q5226171) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)
- Towards Lower Bounds on the Depth of ReLU Neural Networks (Q6100606) (← links)
- A note on the quickest minimum cost transshipment problem (Q6106530) (← links)
- Reduction of Potential-Based Flow Networks (Q6122584) (← links)
- Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size (Q6200143) (← links)
