Quasi-Random PCP and Hardness of 2-Catalog Segmentation
From MaRDI portal
Publication:2908876
DOI10.4230/LIPIcs.FSTTCS.2010.447zbMath1245.68095OpenAlexW2167194753MaRDI QIDQ2908876
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3442.html
Related Items (2)
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix ⋮ Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
This page was built for publication: Quasi-Random PCP and Hardness of 2-Catalog Segmentation