A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
From MaRDI portal
Publication:5085993
DOI10.1287/IJOC.2021.1106OpenAlexW3213046113MaRDI QIDQ5085993FDOQ5085993
Authors: Xinyun Wu, Zhipeng Lü, Fred Glover 
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1106
Recommendations
- Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
- An efficient local search framework for the minimum weighted vertex cover problem
- An Efficient Local Search for the Minimum Independent Dominating Set Problem
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
- Towards faster local search for minimum weight vertex cover on massive graphs
- A greedy approximation for minimum connected dominating sets
- Revisiting connected dominating sets: an optimal local algorithm?
- Approximating the maximum vertex/edge weighted clique using local search
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- Near-optimal distributed approximation of minimum-weight connected dominating set
Cites Work
- The regenerator location problem
- The maximum-leaf spanning tree problem: Formulations and facets
- Breakout local search for the quadratic assignment problem
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Approximation algorithms for connected dominating sets
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
- Flow-based formulation for the maximum leaf spanning tree problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Breakout local search for maximum clique problems
- The broadcast storm problem in a mobile ad hoc network
- Parametric tabu-search for mixed integer programs
- Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
- BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
- Improving local search for random 3-SAT using quantitative configuration checking
- An integer programming approach for fault-tolerant connected dominating sets
- Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
- Graph domination, coloring and cliques in telecommunications
- Spanning trees with a constraint on the number of leaves. A new formulation
- An adaptive flex-deluge approach to university exam timetabling
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
Cited In (4)
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- An efficient local search algorithm for minimum positive influence dominating set problem
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- An efficient sum query algorithm for distance-based locally dominating functions
This page was built for publication: A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085993)
