On the public citation graph

A Simple NOVCA: Near Optimal Vertex Cover Algorithm

0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11523468_84openalex-snapshot
A Better Approximation Ratio for the Vertex Cover Problem
inferredcites →https://doi.org/10.1007/11821069_21openalex-snapshot
Improved Parameterized Upper Bounds for Vertex Cover
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_22openalex-snapshot
Vertex Cover Approximations on Random Graphs
inferredcites →https://doi.org/10.1007/978-3-540-74565-5_31openalex-snapshot
A Stochastic Local Search Approach to Vertex Cover
inferredcites →https://doi.org/10.1007/bf00290149openalex-snapshot
Ramsey numbers and an approximation algorithm for the vertex cover problem
inferredcites →https://doi.org/10.1007/s00224-007-1328-0openalex-snapshot
Crown Structures for Vertex Cover Kernelization
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/cec.2007.4424701openalex-snapshot
Evolutionary algorithms and the Vertex Cover problem
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.1145/1597036.1597045openalex-snapshot
A better approximation ratio for the vertex cover problem
inferredcites →https://doi.org/10.1145/509907.509915openalex-snapshot
The importance of being biased
inferredcites →https://doi.org/10.1145/509914.509915openalex-snapshot
The importance of being biased
inferredcites →https://doi.org/10.3233/fi-1998-35123405openalex-snapshot
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114306openalex-snapshot
A probabilistic algorithm for vertex cover
inferred← citeshttps://doi.org/10.1109/cluster.2015.95openalex-snapshot
Mutated Near Optimal Vertex Cover Algorithm (NOVCA) Visualization on a Tile Display
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3495836openalex-snapshot
Vertex Cover of Networks and Its Related Optimization Problems: An Overview
inferred← citeshttps://doi.org/10.12700/aph.18.4.2021.4.6openalex-snapshot
A Genetic Algorithm for the Minimum Vertex Cover Problem with Interval-Valued Fitness
inferred← citeshttps://doi.org/10.14257/ijast.2014.67.07openalex-snapshot
AVSA, Modified Vertex Support Algorithm for Approximation of MVC
inferred← citeshttps://doi.org/10.14257/ijca.2018.11.2.12openalex-snapshot
Approximate Methods for Minimum Vertex Cover Fail to Provide Optimal Results on Small Graph Instances: A Review
inferred← citeshttps://doi.org/10.14257/ijunesst.2014.7.6.07openalex-snapshot
Experimental Comparison of Five Approximation Algorithms for Minimum Vertex Cover
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0111232openalex-snapshot
A Smart Approximation Algorithm for Minimum Vertex Cover Problem based on Min-to-Min (MtM) Strategy
inferred← citeshttps://doi.org/10.17265/1934-7332/2014.02.004openalex-snapshot
A Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)
inferred← citeshttps://doi.org/10.20334/2019-028-mopenalex-snapshot
Automation of harmonization, analysis and evaluation of information security requirements
inferred← citeshttps://doi.org/10.32604/cmc.2022.027064openalex-snapshot
Vertex Cover Optimization Using a Novel Graph Decomposition Approach
inferred← citeshttps://doi.org/10.3390/app9040681openalex-snapshot
Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques
inferred← citeshttps://doi.org/10.5277/ord150401openalex-snapshot
A new and fast approximation algorithm for vertex cover using a maximum independent set (VCUMI)
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.