On the public citation graph

Kernelization as Heuristic Structure for the Vertex Cover Problem

https://doi.org/10.1007/11839088_45
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.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/11589990openalex-snapshot
AI 2005: Advances in Artificial Intelligence
inferredcites →https://doi.org/10.1007/11589990_81openalex-snapshot
Understanding the Pheromone System Within Ant Colony Optimization
inferredcites →https://doi.org/10.1007/978-1-84800-070-4openalex-snapshot
The Algorithm Design Manual
inferredcites →https://doi.org/10.1007/b99492openalex-snapshot
Ant colony optimization and Swarm intelligence : 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006 : proceedings
inferredcites →https://doi.org/10.1016/j.plrev.2005.10.001openalex-snapshot
Ant colony optimization: Introduction and recent trends
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1023/b:anor.0000039523.95673.33openalex-snapshot
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem
inferredcites →https://doi.org/10.1090/dimacs/049/04openalex-snapshot
Parameterized complexity: A framework for systematically confronting computational intractability
inferredcites →https://doi.org/10.1201/9781420010749-33openalex-snapshot
Ant Colony Optimization
inferredcites →https://doi.org/10.48550/arxiv.cs/0509032openalex-snapshot
A Simple Model to Generate Hard Satisfiable Instances
inferredcites →https://doi.org/10.5860/choice.35-6287openalex-snapshot
The algorithm design manual

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-1-4419-1644-0_9openalex-snapshot
Hybrid Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_12openalex-snapshot
Metaheuristic Hybrids
inferred← citeshttps://doi.org/10.1007/978-3-540-74565-5_31openalex-snapshot
A Stochastic Local Search Approach to Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_5openalex-snapshot
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
inferred← citeshttps://doi.org/10.1007/s10732-012-9211-9openalex-snapshot
A hybridized tabu search approach for the minimum weight vertex cover problem
inferred← citeshttps://doi.org/10.1007/s10732-020-09465-7openalex-snapshot
Augmented intuition: a bridge between theory and practice
inferred← citeshttps://doi.org/10.1016/j.artint.2011.03.003openalex-snapshot
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.02.032openalex-snapshot
Hybrid metaheuristics in combinatorial optimization: A survey
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.05.023openalex-snapshot
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.005openalex-snapshot
Decomposition based hybrid metaheuristics
inferred← citeshttps://doi.org/10.1016/j.ins.2016.08.053openalex-snapshot
An efficient local search framework for the minimum weighted vertex cover problem
inferred← citeshttps://doi.org/10.1109/access.2018.2868846openalex-snapshot
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
inferred← citeshttps://doi.org/10.1109/cec.2007.4424623openalex-snapshot
A Novel Selection-Learning Algorithm for Multi-Satellite Scheduling Problems
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.915645openalex-snapshot
An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7539openalex-snapshot
EWLS: A New Local Search for Minimum Vertex Cover
inferred← citeshttps://doi.org/10.3745/kipstb.2008.15-b.6.609openalex-snapshot
Applying Genetic Algorithm to the Minimum Vertex Cover Problem
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.