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á bibliografie

Vydáno v:	Proceedings of the Steklov Institute of Mathematics Ročník 284; číslo Suppl 1; s. 87 - 95
Hlavní autoři:	Eremin, I. I., Gimadi, E. Kh, Kel’manov, A. V., Pyatkin, A. V., Khachai, M. Yu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.04.2014
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!