Planted Models for the Densest k-Subgraph Problem

04/29/2020
by   Yash Khanna, et al.
0

Given an undirected graph G, the Densest k-subgraph problem (DkS) asks to compute a set S ⊂ V of cardinality | S|≤ k such that the weight of edges inside S is maximized. This is a fundamental NP-hard problem whose approximability, inspite of many decades of research, is yet to be settled. The current best known approximation algorithm due to Bhaskara et al. (2010) computes a O(n^1/4 + ϵ) approximation in time n^O(1/ϵ). We ask what are some "easier" instances of this problem? We propose some natural semi-random models of instances with a planted dense subgraph, and study approximation algorithms for computing the densest subgraph in them. These models are inspired by the semi-random models of instances studied for various other graph problems such as the independent set problem, graph partitioning problems etc. For a large range of parameters of these models, we get significantly better approximation factors for the Densest k-subgraph problem. Moreover, our algorithm recovers a large part of the planted solution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2022

Approximation Algorithms for Flexible Graph Connectivity

We present approximation algorithms for several network design problems ...
research
04/02/2021

Independent Sets in Semi-random Hypergraphs

A set of vertices in a hypergraph is called an independent set if no hyp...
research
06/08/2023

An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

We study the NP-complete Maximum Outerplanar Subgraph problem. The previ...
research
11/30/2017

Approximating Connected Safe Sets in Weighted Trees

For a graph G and a non-negative integral weight function w on the verte...
research
05/21/2020

New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring

In the maximum asymmetric traveling salesman problem (Max ATSP) we are g...
research
05/24/2018

Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery

The problem of computing the vertex expansion of a graph is an NP-hard p...
research
02/10/2020

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

In the Steiner Tree problem we are given an edge weighted undirected gra...

Please sign up or login with your details

Forgot password? Click here to reset