176 results on '"Martin Skutella"'
Search Results
2. Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks.
3. Total Completion Time Scheduling Under Scenarios.
4. On the robustness of potential-based flow networks.
5. A note on the quickest minimum cost transshipment problem.
6. Towards Lower Bounds on the Depth of ReLU Neural Networks.
7. Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
8. A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method.
9. Competitive Strategies for Symmetric Rendezvous on the Line.
10. Packing under convex quadratic constraints.
11. Single source unsplittable flows with arc-wise lower and upper bounds.
12. An Introduction to Transshipments Over Time.
13. Towards Lower Bounds on the Depth of ReLU Neural Networks.
14. Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
15. On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
16. Packing Under Convex Quadratic Constraints.
17. Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds.
18. A Note on the Quickest Minimum Cost Transshipment Problem.
19. Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling.
20. A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
21. Multi-Source Multi-Sink Nash Flows over Time.
22. A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs.
23. Towards Lower Bounds on the Depth of ReLU Neural Networks.
24. A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method.
25. The Simplex Algorithm Is NP-Mighty.
26. Algorithmic results for potential-based flows: Easy and hard cases.
27. Paths to stable allocations.
28. Fast and Memory-Efficient Algorithms for Evacuation Problems.
29. Robust Randomized Matchings.
30. On the complexity of instationary gas flows.
31. A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs.
32. Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
33. PolySCIP.
34. Protection of flows under targeted attacks.
35. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
36. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
37. Node-Balancing by Edge-Increments.
38. Robust randomized matchings.
39. A note on the ring loading problem.
40. The Simplex Algorithm is NP-mighty.
41. Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
42. Unrelated Machine Scheduling with Stochastic Processing Times.
43. A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective.
44. The Power of Recourse for Online MST and TSP.
45. A Note on the Ring Loading Problem.
46. Stochastic Scheduling on Unrelated Machines.
47. Graph Orientation and Flows over Time.
48. Paths to Stable Allocations.
49. Task assignment, sequencing and path-planning in robotic welding cells.
50. The Power of Recourse for Online MST and TSP.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.