The following pages link to (Q4535797):
Displaying 13 items.
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time (Q3575153) (← links)
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
- (Q3741632) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)
- Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
- Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)