Structural Information and Communication Complexity
From MaRDI portal
Publication:5315241
DOI10.1007/b98251zbMath1085.68104OpenAlexW2499215041MaRDI QIDQ5315241
Miroslav Chlebík, Janka Chlebíková
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98251
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (3)
Complexity of approximating bounded variants of optimization problems ⋮ Recoverable Values for Independent Sets ⋮ Packing triangles in low degree graphs and indifference graphs
This page was built for publication: Structural Information and Communication Complexity