The following pages link to (Q5290249):
Displaying 50 items.
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. (Q419378) (← links)
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. (Q419505) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Dynamic coresets (Q834605) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- High-dimensional approximate \(r\)-nets (Q1987244) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- A faster algorithm for truth discovery via range cover (Q2324248) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- Simplified Planar Coresets for Data Streams (Q3512444) (← links)
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions (Q3541136) (← links)
- (Q4558482) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- (Q4633024) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- (Q4998945) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Approximate Convex Hull of Data Streams (Q5002691) (← links)
- Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- Approximating Distance Measures for the Skyline (Q5091120) (← links)
- Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance (Q5093650) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q5136267) (← links)
- (Q5214265) (← links)
- Approximating Largest Convex Hulls for Imprecise Points (Q5443375) (← links)
- (Q5743375) (← links)
