The dense \(k\)-subgraph problem
From MaRDI portal
Publication:5930156
DOI10.1007/s004530010050zbMath0969.68117MaRDI QIDQ5930156
David Peleg, Guy Kortsarz, Uriel Feige
Publication date: 17 April 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010050
68R10: Graph theory (including graph drawing) in computer science
Related Items
An Efficient Algorithm for Enumerating Pseudo Cliques, Hardness and Approximation of Traffic Grooming, Mining relevant information on the Web: a clique-based approach, Finding a Dense-Core in Jellyfish Graphs, Approximating Steiner Networks with Node Weights, Maximum dispersion problem in dense graphs, A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs, Approximating minimum-power degree and connectivity problems, How to allocate review tasks for robust ranking, Improved approximation algorithms for maximum graph partitioning problems, Hardness and approximation of traffic grooming, Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing, An efficient algorithm for solving pseudo clique enumeration problem, Partially ordered knapsack and applications to scheduling, A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs, On minimum power connectivity problems, Min sum clustering with penalties, An approximation algorithm to the \(k\)-Steiner forest problem, Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees, On approximating four covering and packing problems, \(k\)-edge subgraph problems, Approximating the maximum quadratic assignment problem, Complexity of finding dense subgraphs, Sequential vector packing, Iterated tabu search for the maximum diversity problem, An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs, The densest \(k\)-subgraph problem on clique graphs, A ``maximum node clustering problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, The complexity of detecting fixed-density clusters, Degree-Constrained Subgraph Problems: Hardness and Approximation Results
