Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
From MaRDI portal
Publication:2680785
DOI10.1016/j.artint.2022.103819OpenAlexW4308515102MaRDI QIDQ2680785
Wenhao Xu, Jia Ji, Shaowei Cai, Minghao Yin, Yiyuan Wang, Jiejiang Chen
Publication date: 4 January 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103819
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- An order-based algorithm for minimum dominating set with application in graph mining
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A new upper bound for the maximum weight clique problem
- Wireless networking, dominating and packing
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Many hard examples in exact phase transitions
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- An iterative local search approach applied to the optimal stratification problem
- A measure & conquer approach for the analysis of exact algorithms
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
- Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
This page was built for publication: Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
