On the public citation graph

Evolutionary algorithms for vertex cover

https://doi.org/10.1007/bfb0040790
0 signed · 48 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/bf02523693openalex-snapshot
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
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.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/71.473512openalex-snapshot
An inherently parallel method for heuristic problem-solving. II. Example applications
inferredcites →https://doi.org/10.1109/72.165596openalex-snapshot
Guaranteed convergence in a class of Hopfield networks
inferredcites →https://doi.org/10.1109/hicss.1992.183462openalex-snapshot
A genetic learning strategy in constrained search spaces
inferredcites →https://doi.org/10.1109/icec.1994.350004openalex-snapshot
An evolutionary heuristic for the maximum independent set problem
inferredcites →https://doi.org/10.1109/icec.1998.700100openalex-snapshot
Embracing premature convergence: the Hypergamous Parallel Genetic Algorithm
inferredcites →https://doi.org/10.1109/iscas.1989.100747openalex-snapshot
Combinational profiles of sequential benchmark circuits
inferredcites →https://doi.org/10.1109/iscas.1992.230450openalex-snapshot
A practical method for computing vertex covers for large graphs
inferredcites →https://doi.org/10.1145/195058.195221openalex-snapshot
Greed is good
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
inferredcites →https://doi.org/10.1287/opre.45.2.226openalex-snapshot
Optimized Crossover for the Independent Set Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.22134openalex-snapshot
Variable neighborhood search approach with intensified shake for monitor placement
inferred← citeshttps://doi.org/10.1007/978-3-031-34500-5_1openalex-snapshot
A Metaheuristic Approach for Solving Monitor Placement Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_7openalex-snapshot
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem
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-02017-9_43openalex-snapshot
Greedy Local Search and Vertex Cover in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/s00158-025-04078-9openalex-snapshot
An improved quantum-inspired evolutionary algorithm framework implemented to solve minimum vertex cover problem
inferred← citeshttps://doi.org/10.1007/s10732-019-09414-zopenalex-snapshot
An evolutionary hybrid search heuristic for monitor placement in communication networks
inferred← citeshttps://doi.org/10.1007/s40012-016-0113-0openalex-snapshot
On the applicability of Diploid Genetic Algorithms in Vertex Cover Problem
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.dam.2006.06.009openalex-snapshot
The strong metric dimension of graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115185openalex-snapshot
A local search method based on edge age strategy for minimum vertex cover problem in massive graphs
inferred← citeshttps://doi.org/10.1016/j.knosys.2019.03.033openalex-snapshot
Multi-objective evolutionary computation for topology coverage assessment problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.010openalex-snapshot
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
inferred← citeshttps://doi.org/10.1080/01605682.2022.2147458openalex-snapshot
ILSGVCP: An improved local search algorithm for generalized vertex cover problem
inferred← citeshttps://doi.org/10.1109/asyu58738.2023.10296816openalex-snapshot
Application of Minimum Vertex Cover Problem in Functional Brain Connectivity Graphs
inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00008openalex-snapshot
Accelerating Vertex Cover Optimization on a GPU Architecture
inferred← citeshttps://doi.org/10.1109/cec.2002.1004430openalex-snapshot
Greedy closure evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/cec.2007.4424800openalex-snapshot
On improving approximate solutions by evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/cec.2019.8790058openalex-snapshot
A Greedy, Generative, Lattice Representation for Point Packing
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870224openalex-snapshot
The $(1+(\lambda,\lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00028openalex-snapshot
Parallel Vertex Cover Algorithms on GPUs
inferred← citeshttps://doi.org/10.1109/tevc.2009.2014362openalex-snapshot
Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems
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.1109/tsmcc.2004.841903openalex-snapshot
A Comparative Study of Three Evolutionary Algorithms Incorporating Different Amounts of Domain Knowledge for Node Covering Problem
inferred← citeshttps://doi.org/10.1145/2460239.2460248openalex-snapshot
Approximating vertex cover using edge-based representations
inferred← citeshttps://doi.org/10.1145/3071178.3071255openalex-snapshot
Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm
inferred← citeshttps://doi.org/10.1162/evco.2009.17.1.3openalex-snapshot
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
inferred← citeshttps://doi.org/10.1613/jair.3907openalex-snapshot
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
inferred← citeshttps://doi.org/10.31274/rtd-180813-14274openalex-snapshot
Enumeration and symmetry of edit metric spaces
inferred← citeshttps://doi.org/10.3745/kipstb.2008.15-b.6.609openalex-snapshot
Applying Genetic Algorithm to the Minimum Vertex Cover Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1311.1626openalex-snapshot
Trade-offs Computing Minimum Hub Cover toward Optimized Graph Query Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1311.7215openalex-snapshot
Solving Minimum Vertex Cover Problem Using Learning Automata
inferred← citeshttps://doi.org/10.5120/ijca2015905785openalex-snapshot
The Applicability of Genetic algorithm to Vertex Cover
inferred← citeshttps://doi.org/10.5824/1309-1581.2018.3.002.xopenalex-snapshot
Trade-offs Computing Minimum Hub Cover toward Optimized Labeled Graph Query Processing
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.