scientific article; zbMATH DE number 7650078

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.11MaRDI QIDQ5875462

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

Publication date: 3 February 2023

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

zbMATH Keywords

approximationsspanners

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• On sparse spanners of weighted graphs
• Approximation algorithms for spanner problems and directed Steiner forest
• The hardness of approximating spanner problems
• All-Norm Approximation Algorithms
• Proof verification and the hardness of approximation problems
• All-Norms and All-L_p-Norms Approximation Algorithms
• Server scheduling in the L _p norm
• Probabilistic checking of proofs
• A Parallel Repetition Theorem
• Approximating Low-Stretch Spanners
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• Least squares quantization in PCM
• Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
• Directed spanners via flow-based linear programs
• Concentration of Measure for the Analysis of Randomized Algorithms
• On the hardness of approximating spanners

This page was built for publication: