The following pages link to Andreas Wiese (Q490330):
Displaying 4 items.
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- A New Approach to Online Scheduling (Q4962651) (← links)
- A PTAS for minimizing weighted flow time on a single machine (Q6499308) (← links)
