Pages that link to "Item:Q2819576"
From MaRDI portal
The following pages link to Sublinear time algorithms for metric space problems (Q2819576):
Displaying 45 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- A lower bound for metric 1-median selection (Q340556) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection (Q497691) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- The projection median of a set of points (Q1025289) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Fast algorithms for approximating distances (Q1601023) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces (Q2152004) (← links)
- On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- On approximating metric 1-median in sublinear time (Q2445898) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Approximate Greedy Clustering and Distance Selection for Graph Metrics (Q3387276) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)
- On Combinatorial Depth Measures (Q4631012) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Seeding with Costly Network Information (Q5106371) (← links)
- Speeding up spatial approximation search in metric spaces (Q5406214) (← links)
- (Q5491026) (← links)
- Net and prune (Q5495831) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Automata, Languages and Programming (Q5716835) (← links)
- Computing and Combinatorics (Q5716965) (← links)
- (Q5743440) (← links)
- (Q5874507) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5919792) (← links)
- A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
- Approximating all-points furthest pairs and maximum spanning trees in metric spaces (Q6569899) (← links)
- Deterministic metric 1-median selection with very few queries (Q6590087) (← links)
