The following pages link to STACS 2005 (Q5710715):
Displaying 8 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Cycle double covers and the semi-Kotzig frame (Q412256) (← links)
- Multicover Ucycles (Q1343787) (← links)
- Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- The bounded cycle-cover problem (Q2884498) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)