Approximation of Self-stabilizing Vertex Cover Less Than 2

From MaRDI portal

Revision as of 22:06, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5307040

Jump to:navigation, search

DOI10.1007/11577327_12zbMath1172.68682OpenAlexW1855768119MaRDI 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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

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

This page was built for publication: Approximation of Self-stabilizing Vertex Cover Less Than 2

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5307040&oldid=19975703"