The following pages link to STACS 2005 (Q5710713):
Displaying 7 items.
- Typical rounding problems (Q1884960) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
- Roundings respecting hard constraints (Q2643143) (← links)
- Randomized rounding in the presence of a cardinality constraint (Q2828177) (← links)
- On the Computational Complexity of Linear Discrepancy (Q5874541) (← links)