Pages that link to "Item:Q1872716"
From MaRDI portal
The following pages link to Combining polynomial running time and fast convergence for the disk-covering method. (Q1872716):
Displaying 4 items.
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Fast neighbor joining (Q1019174) (← links)
- A polynomial time algorithm for constructing the refined Buneman tree (Q1808975) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)