Algorithms and Computation
From MaRDI portal
Publication:5191669
DOI10.1007/b94771zbMath1205.68168OpenAlexW1769833081MaRDI QIDQ5191669
Janka Chlebíková, Miroslav Chlebík
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem ⋮ Approximation algorithms for partially covering with edges ⋮ Approximability of the capacitated \(b\)-edge dominating set problem ⋮ Generalizing the induced matching by edge capacity constraints
This page was built for publication: Algorithms and Computation