Pages that link to "Item:Q2768379"
From MaRDI portal
The following pages link to Reductions among high dimensional proximity problems (Q2768379):
Displaying 14 items.
- Space exploration via proximity search (Q312150) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- High-dimensional approximate \(r\)-nets (Q1987244) (← links)
- Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball (Q2088318) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- Optimal core-sets for balls (Q2479470) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)
