An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

DOI10.1007/11830924_7zbMath1155.68603OpenAlexW2166944557MaRDI QIDQ3595393

Benjamin Birnbaum, Kenneth J. Goldman

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1179&context=cse_research

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs