✦ LIBER ✦

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

✍ Scribed by Eremin, I. I.; Gimadi, E. Kh.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.

Book ID: 121869164
Publisher: SP MAIK Nauka/Interperiodica
Year: 2014
Tongue: English
Weight: 399 KB
Volume: 284
Category: Article
ISSN: 0081-5438
DOI: 10.1134/S0081543814020084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A -approximation algorithm for minimum-c

A -approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

✍ Cohen, Nachshon; Nutov, Zeev 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB

Approximation algorithms for solving the

Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2

✍ E. Kh. Gimadi; Yu. V. Glazkov; A. N. Glebov 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 650 KB

Addendum: Minimum Weighted Coloring of T

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

✍ Balas, Egon; Xue, Jue 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 88 KB

A 3/2-Approximation Algorithm for Findin

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

✍ Bonsma, Paul; Zickfeld, Florian 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 231 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will