scientific article; zbMATH DE number 7561533

DOI10.4230/LIPIcs.ICALP.2019.40MaRDI QIDQ5091190

Eden Chlamtáč, Michael Dinitz, Thomas J. Robinson

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1903.07418

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationsspanners

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• On sparse spanners of weighted graphs
• Detecting high log-densities
• Fault-tolerant spanners
• All-Norms and All-L_p-Norms Approximation Algorithms
• Graph spanners
• Generating Low-Degree 2-Spanners
• Approximating Low-Stretch Spanners
• Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
• Approximation Algorithms for Label Cover and The Log-Density Threshold
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• An Optimal Synchronizer for the Hypercube
• Least squares quantization in PCM
• Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
• The Greedy Spanner is Existentially Optimal
• Directed spanners via flow-based linear programs

This page was built for publication: