Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
From MaRDI portal
Publication:4989343
DOI10.1613/jair.1.12618OpenAlexW3160441411MaRDI QIDQ4989343
Yiyuan Wang, Bohan Li, Shaowei Cai, Xindi Zhang
Publication date: 25 May 2021
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.12618
Related Items (3)
A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ Fast distributed consensus seeking in large-scale and high-density multi-agent systems with connectivity maintenance
Uses Software
Cites Work
- Unnamed Item
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Local search for Boolean satisfiability with configuration checking and subscore
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- An exact algorithm for the maximum leaf spanning tree problem
- A greedy approximation for minimum connected dominating sets
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- Solving connected dominating set faster than \(2^n\)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Efficient virtual-backbone routing in mobile ad hoc networks
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- The regenerator location problem
- The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
- BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
This page was built for publication: Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
