Summary: An Improved Analysis for a Greedy Remote-Clique Algorithm
Using Factor-Revealing LPs
Benjamin Birnbaum
Department of Computer Science and Engineering
University of Washington, Seattle
Box 352350
Seattle, WA 98105-2350
birnbaum@cs.washington.edu
Kenneth J. Goldman
Department of Computer Science and Engineering
Washington University in St. Louis
Campus Box 1045
One Brookings Drive
St. Louis, Missouri 63130-4899
kjg@cse.wustl.edu
Abstract
Given a positive integer k and a complete graph with non-negative edge weights satisfying
the triangle inequality, the remote-clique problem is to find a subset of k vertices having a
maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to
have an approximation ratio of 4, but this analysis was not shown to be tight. In this paper, we

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

Collections: Computer Technologies and Information Sciences