On multiplicative -approximations and some geometric applications

MaRDI QIDQ5743377zbMATH OpenFDO

Authors Ilan Newman, Yuri Rabinovich

Publication date 10 May 2019

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

Mathematics Subject Classification ID

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

Recommendations

• On multiplicative -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

Cites work

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

Cited in

(2)

• Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
• On multiplicative -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)