Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

The densest k-subgraph problem asks for a k-vertex subgraph with the maximum number of edges. This problem is NP-hard on bipartite graphs, chordal graphs, and planar graphs. A 3-approximation algorithm is known for chordal graphs. We present 3 2 -approximation algorithms for proper interval graphs a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 110; číslo 16; s. 635 - 638
Hlavní autoři:	Backer, Jonathan, Keil, J. Mark
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 31.07.2010 Elsevier Elsevier Sequoia S.A
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithms Bipartite permutation graph Combinatorics Computer science; control theory; systems Densest subgraph Exact sciences and technology Graph algorithms Graphs Information retrieval. Graph Intervals Mathematical analysis Miscellaneous Permutations Proper interval graph Studies Theoretical computing Approximation algorithms Densest subgraph Bipartite permutation graph Proper interval graph Interval graph Vertex Computer theory Planar graph Permutation graph Chordal graph Approximation algorithm Maximum NP hard problem Information processing Subgraph Bipartite graph Algorithm analysis Graph algorithm
ISSN:	0020-0190, 1872-6119
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!

Buďte první, kdo okomentuje tento záznam!