Approximation of Self-stabilizing Vertex Cover Less Than 2
From MaRDI portal
Publication:5307040
DOI10.1007/11577327_12zbMath1172.68682MaRDI QIDQ5307040
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11577327_12
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W25: Approximation algorithms
68W15: Distributed algorithms
Related Items
A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks, The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification