✦ LIBER ✦

Threshold-based preprocessing for approximating the weighted dense k-subgraph problem

✍ Scribed by Borgwardt, S.; Schmiedl, F.

Book ID: 122647321
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 959 KB
Volume: 234
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.09.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithm for the minimum

Approximation algorithm for the minimum weight connected k-subgraph cover problem

✍ Zhang, Yaping; Shi, Yishuo; Zhang, Zhao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 212 KB

An $O(\log^2{k})$-Approximation Algorith

An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem

✍ Fakcharoenphol, Jittat; Laekhanukit, Bundit 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 254 KB

Approximating Element-Weighted Vertex De

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property

✍ Reuven Bar-Yehuda; Dror Rawitz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 143 KB

A k-partite graph is a graph G s V , . . . , V , E , where V , . . . , V are k non- We discuss three variants of the following optimization i / j i j problem: given a graph and a non-negative weight function on the vertices and edges, find a minimum weight set of vertices and incident edges whose r