On the public citation graph
Approximation of Self-stabilizing Vertex Cover Less Than 2
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11533719_85openalex-snapshot
Distributed Weighted Vertex Cover via Maximal Matchings
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/bf03167363openalex-snapshot
An approximation of the minimum vertex cover in a graph
inferredcites →https://doi.org/10.1007/pl00008932openalex-snapshot
Some simple distributed algorithms for sparse networks
inferredcites →https://doi.org/10.1016/0020-0190(82)90022-9openalex-snapshot
Depth-first search and the vertex cover problem
inferredcites →https://doi.org/10.1016/0020-0190(92)90015-nopenalex-snapshot
A self-stabilizing algorithm for maximal matching
inferredcites →https://doi.org/10.1016/0020-0190(94)90098-1openalex-snapshot
Maximal matching stabilizes in quadratic time
inferredcites →https://doi.org/10.1016/s0020-0190(01)00171-5openalex-snapshot
Maximal matching stabilizes in time O(m)
inferredcites →https://doi.org/10.1016/s0167-5060(13)71062-8openalex-snapshot
Annals of Discrete Mathematics 56
inferredcites →https://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1109/71.588622openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1109/icdcs.2002.1022305openalex-snapshot
Timestamping messages in synchronous computations
inferredcites →https://doi.org/10.1109/infcom.2003.1208666openalex-snapshot
Robust monitoring of link delays and faults in IP networks
inferredcites →https://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
inferredcites →https://doi.org/10.1137/s0895480100373121openalex-snapshot
On the Distributed Complexity of Computing Maximal Matchings
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/571825.571877openalex-snapshot
Dynamic and self-stabilizing distributed matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_24openalex-snapshot
Extending Lattice Linearity for Self-stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_21openalex-snapshot
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_24openalex-snapshot
A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2021.108144openalex-snapshot
Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.010openalex-snapshot
A fault-containing self-stabilizing (3−2Δ+1) -approximation algorithm for vertex cover in anonymous networks
inferred← citeshttps://doi.org/10.1051/ita/2010018openalex-snapshot
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification
inferred← citeshttps://doi.org/10.1109/iceee2.2018.8391375openalex-snapshot
Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in WSNs
inferred← citeshttps://doi.org/10.1109/iceeie52663.2021.9616719openalex-snapshot
Performance Evaluation of Capacitated Vertex Cover Algorithms for Security Applications in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/siu.2018.8404284openalex-snapshot
Evaluation of fault tolerant link monitoring algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.1142/s0129626410000132openalex-snapshot
SELF-STABILIZING VERTEX COVER IN ANONYMOUS NETWORKS WITH OPTIMAL APPROXIMATION RATIO
inferred← citeshttps://doi.org/10.1145/3571306.3571391openalex-snapshot
Analyzing Program Transitions to Compute Benefit of Tolerating Consistency Violation Faults
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.3929/ethz-a-006857451openalex-snapshot
The uniform minimum-ones 2SAT problem and its application to haplotype classification
inferred← citeshttps://doi.org/10.4018/978-1-4666-9964-9.ch001openalex-snapshot
On Vertex Cover Problems in Distributed Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2116openalex-snapshot
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems
inferred← citeshttps://doi.org/10.48550/arxiv.2109.13216openalex-snapshot
Extending Lattice linearity for Self-Stabilizing Algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.