Results 1  10
of
216,835
Densest kSubgraph Approximation on Intersection Graphs
"... Abstract. We study approximation solutions for the densest ksubgraph problem (DSk) on several classes of intersection graphs. We adopt the concept of σquasi elimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple O ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We study approximation solutions for the densest ksubgraph problem (DSk) on several classes of intersection graphs. We adopt the concept of σquasi elimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple
PTAS for Densest kSubgraph in Interval Graphs
, 2011
"... Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest ksubgraph problem in interval graphs. It has been shown that this problem is NPhard even for chordal graphs [17], and there is probably no PTAS for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
for general graphs [12]. However, the exact complexity status for interval graphs is a longstanding open problem [17], and the best known approximation result is a 3approximation algorithm [16]. We shed light on the approximation complexity of finding a densest ksubgraph in interval graphs by presenting a
The densest ksubgraph problem on clique graphs
 IN INTERNATIONAL COMBINATORICS, GEOMETRY AND COMPUTER SCIENCE CONFERENCE
, 2007
"... The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this p ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS
The Dense kSubgraph Problem
 Algorithmica
, 1999
"... This paper considers the problem of computing the dense kvertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n ffi ), for some ffi ! 1=3. 1 Introduction We study the dense ksubgraph (D ..."
Abstract

Cited by 205 (12 self)
 Add to MetaCart
This paper considers the problem of computing the dense kvertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n ffi ), for some ffi ! 1=3. 1 Introduction We study the dense ksubgraph
Exact and approximation algorithms for densest ksubgraph
, 2012
"... The densest ksubgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of d ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The densest ksubgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions
Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph
"... The Densest ksubgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant gap between known upper and lower bounds for Densest ksubgraph: the current best algorithm gives an ≈ O(n 1/4) approximatio ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
The Densest ksubgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant gap between known upper and lower bounds for Densest ksubgraph: the current best algorithm gives an ≈ O(n 1
Approximating the Sparsest kSubgraph in Chordal Graphs
, 2013
"... Given a simple undirected graph G = (V, E) and an integer k < V, the Sparsest kSubgraph problem asks for a set of k vertices which induces the minimum number of edges. As a generalization of the classical independent set problem, Sparsest kSubgraph is N Phard and even not approximable unless ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a simple undirected graph G = (V, E) and an integer k < V, the Sparsest kSubgraph problem asks for a set of k vertices which induces the minimum number of edges. As a generalization of the classical independent set problem, Sparsest kSubgraph is N Phard and even not approximable
A constant approximation algorithm for the densest ksubgraph problem on chordal graphs
, 2008
"... ..."
Detecting High LogDensities – an O(n 1/4) Approximation for Densest kSubgraph
"... In the Densest kSubgraph problem, given a graph G and a parameter k, one needs to find a subgraph of G induced on k vertices that contains the largest number of edges. There is a significant gap between the best known upper and lower bounds for this problem. It is NPhard, and does not have a PTAS ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
approximates the Densest kSubgraph problem within a ratio of n1/4+ε in time nO(1/ε). If allowed to run for time nO(log n) , our algorithm achieves an approximation ratio of O(n1/4). Our algorithm is inspired by studying an averagecase version of the problem where the goal is to distinguish random graphs from
DOI 10.1007/s1087800790691 The densest ksubgraph problem on clique graphs
, 2007
"... Abstract The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In ..."
Abstract
 Add to MetaCart
Abstract The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS
Results 1  10
of
216,835