The following pages link to James Willson (Q281772):
Displaying 7 items.
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity (Q924146) (← links)
- On dual power assignment optimization for biconnectivity (Q965816) (← links)
- On the geometry of numerical ranges over finite fields (Q1979396) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Comparing methods for species tree estimation with gene duplication and loss (Q2062005) (← links)
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (Q3397508) (← links)
