The Density Maximization Problem in Graphs

DOI10.1007/978-3-642-22685-4_3zbMath1353.90167MaRDI QIDQ3087936

Bastian Katz, Dorothea Wagner, Ignaz Rutter, Mong-Jen Kao, Marcus Krug, Der-Tsai Lee

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000023123/1978060

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90C59: Approximation methods and heuristics in mathematical programming

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms