Positive linear programming, parallel approximation and PCP's

DOI10.1007/3-540-61680-2_47zbMath1379.68357OpenAlexW1798514331MaRDI QIDQ4595478

Luca Trevisan

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_47

Mathematics Subject Classification ID

Linear programming (90C05) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Related Items (4)

Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) ⋮ Approximate clustering of incomplete fingerprints ⋮ Linear-consistency testing. ⋮ Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.

This page was built for publication: Positive linear programming, parallel approximation and PCP's