On multiplicative -approximations and some geometric applications

zbMATH Open1423.28031MaRDI QIDQ5743377FDOQ5743377

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095121

Recommendations

On multiplicative \(\lambda\)-approximations and some geometric applications
LATIN 2004: Theoretical Informatics
Volume in general metric spaces
Volume in general metric spaces
Matrix approximation and projective clustering via volume sampling

Classical measure theory (28A99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Metric spaces, metrizability (54E35) Combinatorial probability (60C99)

Cites Work

Extensions of Lipschitz mappings into a Hilbert space
Sharper bounds for Gaussian and empirical processes
Title not available (Why is that?)
Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
Embedding Subspaces of L 1 into l N 1
On the impossibility of dimension reduction in l ₁
Homological connectivity of random k -dimensional complexes
Title not available (Why is that?)
Title not available (Why is that?)
Geometric discrepancy. An illustrated guide
Homological connectivity of random 2-complexes
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Title not available (Why is that?)
An exact result for 3-graphs
Twice-Ramanujan sparsifiers
On sparse spanners of weighted graphs
Geometric approximation algorithms
The fundamental group of random 2-complexes.
On Lipschitz embedding of finite metric spaces in Hilbert space
Cuts, trees and \(\ell_1\)-embeddings of graphs
Title not available (Why is that?)
Near Linear Lower Bound for Dimension Reduction in L1
Approximating the bandwidth via volume respecting embeddings
A Moore bound for simplicial complexes
Minors in random and expanding hypergraphs
A unified framework for approximating and clustering data
Topological characteristics of random triangulated surfaces
Hardness of embedding simplicial complexes in \(\mathbb R^d\)
Improved bounds on the sample complexity of learning
Isometric embedding in \(\ell_ p\)-spaces
On Approximating the Average Distance Between Points
Randomized approximation schemes for cuts and flows in capacitated graphs
Near Optimal Dimensionality Reductions That Preserve Volumes

Cited In (2)

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
On multiplicative \(\lambda\)-approximations and some geometric applications

This page was built for publication: On multiplicative \(\lambda\)-approximations and some geometric applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743377)