2-Approximation algorithm for finding a clique with minimum weight of vertices and edges

The problem of finding a minimum clique (with respect to the total weight of its vertices and edges) of fixed size in a complete undirected weighted graph is considered along with some of its important subclasses. Approximability issues are analyzed. The inapproximability of the problem is proved fo...

Full description

Bibliographic Details

Published in:	Proceedings of the Steklov Institute of Mathematics Vol. 284; no. Suppl 1; pp. 87 - 95
Main Authors:	Eremin, I. I., Gimadi, E. Kh, Kel’manov, A. V., Pyatkin, A. V., Khachai, M. Yu
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.04.2014
Subjects:	Mathematics Mathematics and Statistics approximation guarantee minimum weight of vertices and edges subset search time complexity clique of fixed size complete undirected graph polynomial time approximation algorithm approximability
ISSN:	0081-5438, 1531-8605
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!