The following pages link to On min-max \(r\)-gatherings (Q627109):
Displaying 12 items.
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes (Q2232242) (← links)
- A linear time algorithm for the \(r\)-gathering problem on the line (Q2662686) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Assigning Proximity Facilities for Gatherings (Q2817866) (← links)
- On r-Gatherings on the Line (Q3452549) (← links)
- r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
- A Simple Algorithm for $r$-gatherings on the Line (Q5240371) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Online facility assignment (Q5919330) (← links)
