A note on the approximability of the dense subgraph problem.
type: Item
instance of: scholarly article
title: A note on the approximability of the dense subgraph problem.
zbMATH Open document ID: 1067.68078
published in: Matematychni Studiï
publication date: 2005-05-20T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2169810
zbMATH Keywords: dense subgraph problem
zbMATH Keywords: optimization
zbMATH Keywords: approximate solution
author: O. V. Verbitskii
MaRDI profile type: Publication
Recommended article: A deterministic approximation algorithm for the densest \(k\)-subgraph problem
Recommended article: Exact and Approximation Algorithms for Densest k-Subgraph
Recommended article: The dense \(k\)-subgraph problem
Recommended article: On Finding Dense Subgraphs
Recommended article: On solving the densestk-subgraph problem on large graphs
Recommended article: Q4400856
Recommended article: The densest subgraph problem in sparse random graphs
Recommended article: Complexity of finding dense subgraphs
Recommended article: Proportionally dense subgraph of maximum size: complexity and approximation
Recommended article: Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
description: scientific article; zbMATH DE number 2169810