The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 20 items.
- Non-preemptive tree packing (Q5918626) (← links)
- Non-preemptive tree packing (Q5925632) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- A note on the depth function of combinatorial optimization problems (Q5929316) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- A comment on consecutive-2-out-of-\(n\) systems (Q5945385) (← links)
- A polynomially solvable special case of the unbounded knapsack problem (Q5949903) (← links)
- Linear time approximation scheme for the multiprocessor open shop problem (Q5954097) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Sometimes travelling is easy: The master tour problem (Q6102296) (← links)
- Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations (Q6106537) (← links)
- (Q6192487) (← links)
- Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces (Q6301271) (← links)
- One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs (Q6550549) (← links)
- Recognising permuted Demidenko matrices (Q6556164) (← links)
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms (Q6556180) (← links)
- Travelling salesman paths on Demidenko matrices (Q6558670) (← links)
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem (Q6567677) (← links)
- Worst-case analysis for on-line data compression (Q6567689) (← links)
