On the public citation graph

Restricted swap-based neighborhood search for the minimum connected dominating set problem

https://doi.org/10.1002/net.21728
0 signed · 49 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.1002/net.20001openalex-snapshot
The maximum‐leaf spanning tree problem: Formulations and facets
inferredcites →https://doi.org/10.1002/net.20366openalex-snapshot
The regenerator location problem
inferredcites →https://doi.org/10.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1002/wcm.378openalex-snapshot
Virtual backbone construction in multihop ad hoc wireless networks
inferredcites →https://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4613-0219-3_4openalex-snapshot
A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-21527-8_21openalex-snapshot
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s10287-009-0116-5openalex-snapshot
Reformulations and solution algorithms for the maximum leaf spanning tree problem
inferredcites →https://doi.org/10.1016/j.amc.2012.10.106openalex-snapshot
Breakout local search for the quadratic assignment problem
inferredcites →https://doi.org/10.1016/j.comcom.2012.10.005openalex-snapshot
Connected dominating sets in wireless ad hoc and sensor networks – A comprehensive survey
inferredcites →https://doi.org/10.1016/j.comnet.2015.04.013openalex-snapshot
GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks
inferredcites →https://doi.org/10.1016/j.cor.2012.06.002openalex-snapshot
Breakout Local Search for maximum clique problems
inferredcites →https://doi.org/10.1016/j.cor.2014.08.006openalex-snapshot
A tabu search/path relinking algorithm to solve the job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2008.12.007openalex-snapshot
Adaptive Tabu Search for course timetabling
inferredcites →https://doi.org/10.1016/j.ejor.2009.07.016openalex-snapshot
A memetic algorithm for graph coloring
inferredcites →https://doi.org/10.1016/j.engappai.2012.09.001openalex-snapshot
Breakout Local Search for the Max-Cutproblem
inferredcites →https://doi.org/10.1016/j.jnca.2012.03.005openalex-snapshot
A weight-value algorithm for finding connected dominating sets in a MANET
inferredcites →https://doi.org/10.1016/s0305-0548(02)00117-xopenalex-snapshot
An exact algorithm for the maximum leaf spanning tree problem
inferredcites →https://doi.org/10.1023/a:1013763825347openalex-snapshot
The Broadcast Storm Problem in a Mobile Ad Hoc Network
inferredcites →https://doi.org/10.1023/a:1016542229220openalex-snapshot
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1023/b:mone.0000013625.87793.13openalex-snapshot
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/aict.2007.28openalex-snapshot
Metaheuristics for Wireless Network Optimisation
inferredcites →https://doi.org/10.1109/snpa.2003.1203353openalex-snapshot
Multi-resolution state retrieval in sensor networks
inferredcites →https://doi.org/10.1109/tpds.2009.78openalex-snapshot
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
inferredcites →https://doi.org/10.1109/twc.2009.051053openalex-snapshot
On the construction of 2-connected virtual backbone in wireless networks
inferredcites →https://doi.org/10.1109/vetecf.2003.1285913openalex-snapshot
Aggregation tree construction in sensor networks
inferredcites →https://doi.org/10.1142/s0129054103001686openalex-snapshot
BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1287/ijoc.2013.0589openalex-snapshot
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
inferredcites →https://doi.org/10.2298/csis110927038jopenalex-snapshot
Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating 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.22005openalex-snapshot
Solving Steiner trees: Recent advances, challenges, and perspectives
inferred← citeshttps://doi.org/10.1007/978-3-030-58861-8_18openalex-snapshot
Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/s10878-024-01175-1openalex-snapshot
A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
inferred← citeshttps://doi.org/10.1007/s11227-025-07014-2openalex-snapshot
An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem
inferred← citeshttps://doi.org/10.1007/s11704-022-2178-2openalex-snapshot
A two-level meta-heuristic approach for the minimum dominating tree problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.04.028openalex-snapshot
An algorithm based on ant colony optimization for the minimum connected dominating set problem
inferred← citeshttps://doi.org/10.1080/01605682.2021.1952117openalex-snapshot
A restart local search algorithm with Tabu method for the minimum weighted connected dominating set problem
inferred← citeshttps://doi.org/10.1109/access.2020.3018618openalex-snapshot
Effective Approaches to Solve P-Center Problem via Set Covering and SAT
inferred← citeshttps://doi.org/10.1109/iceiec49280.2020.9152306openalex-snapshot
Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem
inferred← citeshttps://doi.org/10.1109/ictaacs69003.2025.11399313openalex-snapshot
Multi-Objective GRASP Based on the Pareto Dominance Approach for the Bi-Objective CDS Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1106openalex-snapshot
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
inferred← citeshttps://doi.org/10.1613/jair.1.12618openalex-snapshot
Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
inferred← citeshttps://doi.org/10.17771/pucrio.acad.34169openalex-snapshot
MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM
inferred← citeshttps://doi.org/10.24963/ijcai.2020/209openalex-snapshot
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set
inferred← citeshttps://doi.org/10.3390/math11194214openalex-snapshot
Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem
inferred← citeshttps://doi.org/10.48084/etasr.8272openalex-snapshot
A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set 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.