The complexity of linear programming in \((\gamma ,\kappa )\)-form

DOI10.1016/j.ipl.2007.08.025zbMath1191.68863OpenAlexW2058105169MaRDI QIDQ2380073

Pavlos S. Efraimidis

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.025

zbMATH Keywords

computational complexityanalysis of algorithmsapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Parallel approximation algorithms by positive linear programming
• A sublinear-time randomized approximation algorithm for matrix games
• Erratum: A correction to Parallel approximation algorithms by positive linear programming
• A parallel approximation algorithm for positive linear programming

This page was built for publication: The complexity of linear programming in \((\gamma ,\kappa )\)-form