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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the Steklov Institute of Mathematics Ročník 284; číslo Suppl 1; s. 87 - 95
Hlavní autori:	Eremin, I. I., Gimadi, E. Kh, Kel’manov, A. V., Pyatkin, A. V., Khachai, M. Yu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.04.2014
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!