The following pages link to Daniel Golovin (Q2515037):
Displayed 8 items.
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- Simultaneous source location (Q2930292) (← links)
- All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959) (← links)
- Uniquely Represented Data Structures for Computational Geometry (Q3512445) (← links)
- Approximating the <i>k</i>-multicut problem (Q3581503) (← links)
- B-Treaps: A Uniquely Represented Alternative to B-Trees (Q3638058) (← links)
- Quorum placement in networks (Q5177260) (← links)
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems (Q5449799) (← links)