Tài liệu tham khảo |
Loại |
Chi tiết |
[1] Mayra Albuquerque and Thibaut Vidal. “An efficient matheuristic for the minimum-weight dominating set problem”. inApplied Soft Computing: 72 (2018), pages 527–538 |
Sách, tạp chí |
Tiêu đề: |
An efficient matheuristic for the minimum-weight dominating set problem |
Tác giả: |
Mayra Albuquerque and Thibaut Vidal. “An efficient matheuristic for the minimum-weight dominating set problem”. inApplied Soft Computing: 72 |
Năm: |
2018 |
|
[2] Salim Bouamama and Christian Blum. “A hybrid algorithmic model for the minimum weight dominating set problem”. inSimulation Modelling Practice and Theory: 64 (2016). Advances on Information andCommunication Systems, pages57–68 |
Sách, tạp chí |
Tiêu đề: |
A hybrid algorithmic model for the minimum weight dominating set problem |
Tác giả: |
Salim Bouamama and Christian Blum. “A hybrid algorithmic model for the minimum weight dominating set problem”. inSimulation Modelling Practice and Theory: 64 |
Năm: |
2016 |
|
[3] Miroslav Chlebík and Janka Chlebíková. “Approximation hardness of dominating set problems”. In (2004): pages 192–203 |
Sách, tạp chí |
Tiêu đề: |
Approximation hardness of dominating set problems |
Tác giả: |
Miroslav Chlebík and Janka Chlebíková. “Approximation hardness of dominating set problems”. In |
Năm: |
2004 |
|
[4] Stephen A Cook. “The complexity of theorem-proving procedures”. In (1971): pages 151–158 |
Sách, tạp chí |
Tiêu đề: |
The complexity of theorem-proving procedures |
Tác giả: |
Stephen A Cook. “The complexity of theorem-proving procedures”. In |
Năm: |
1971 |
|
[5] Pierluigi Crescenzi. “A short guide to approximation preserving reductions”. inProceedings of Computational Complexity. Twelfth Annual IEEE Conference: IEEE.1997, pages 262–273 |
Sách, tạp chí |
Tiêu đề: |
A short guide to approximation preserving reductions |
|
[6] Hongwei Du andothers. “Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks”.in2011 Proceedings IEEE INFOCOM: IEEE. 2011, pages 1737–1744 |
Sách, tạp chí |
Tiêu đề: |
Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks |
|
[7] Thomas A Feo and Mauricio GC Resende. “A probabilistic heuristic for a computationally difficult set covering problem”. inOperations research letters: 8.2 (1989), pages 67–71 |
Sách, tạp chí |
Tiêu đề: |
A probabilistic heuristic for a computationally difficult set covering problem |
Tác giả: |
Thomas A Feo and Mauricio GC Resende. “A probabilistic heuristic for a computationally difficult set covering problem”. inOperations research letters: 8.2 |
Năm: |
1989 |
|
[9] Richard M Karp. “Reducibility among combinatorial problems”. In (1972): pages 85–103 |
Sách, tạp chí |
Tiêu đề: |
Reducibility among combinatorial problems |
Tác giả: |
Richard M Karp. “Reducibility among combinatorial problems”. In |
Năm: |
1972 |
|
[10] Mohammad Mehdi Daliri Khomami andothers. “Minimum positive influence dominating set and its application in influence maximization: a learning automata approach”. inApplied Intelligence: 48.3 (2018), pages 570–593 |
Sách, tạp chí |
Tiêu đề: |
Minimum positive influence dominating set and its application in influence maximization: a learning automata approach |
Tác giả: |
Mohammad Mehdi Daliri Khomami andothers. “Minimum positive influence dominating set and its application in influence maximization: a learning automata approach”. inApplied Intelligence: 48.3 |
Năm: |
2018 |
|
[11] Siyu Lei andothers. “Online influence maximization”. InProceedings of the 21th ACM SIGKDDInternational Conference on KnowledgeDiscovery and Data Mining: 2015, pages 645–654 |
Sách, tạp chí |
Tiêu đề: |
Online influence maximization |
|
[12] Bohan Li andothers. “NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set”. InProceedings of the Twenty- Ninth International Joint Conference on Artificial Intelligence IJCAI-20, Yokohama, Japan: 2020, pages 11–17 |
Sách, tạp chí |
Tiêu đề: |
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set |
|
[13] Geng Lin and Jian Guan. “A binary particle swarm optimization for the minimum weight dominating set problem”. InJournal of Computer Science and Technology: 33.2 (2018), pages 305–322 |
Sách, tạp chí |
Tiêu đề: |
A binary particle swarm optimization for the minimum weight dominating set problem |
Tác giả: |
Geng Lin and Jian Guan. “A binary particle swarm optimization for the minimum weight dominating set problem”. InJournal of Computer Science and Technology: 33.2 |
Năm: |
2018 |
|
[14] Geng Lin, Wenxing Zhu and Montaz M Ali. “An effective hybrid memetic algorithm for the minimum weight dominating set problem”. inIEEE |
Sách, tạp chí |
Tiêu đề: |
An effective hybrid memetic algorithm for the minimum weight dominating set problem |
|
[15] Tayler Pino, Salimur Choudhury and Fadi Al-Turjman. “Dominating set algorithms for wireless sensor networks survivability”. inIEEE Access: 6 (2018), pages 17527–17532 |
Sách, tạp chí |
Tiêu đề: |
Dominating set algorithms for wireless sensor networks survivability |
Tác giả: |
Tayler Pino, Salimur Choudhury and Fadi Al-Turjman. “Dominating set algorithms for wireless sensor networks survivability”. inIEEE Access: 6 |
Năm: |
2018 |
|
[16] David Pisinger and Stefan Ropke. “Large neighborhood search”. In (2010): pages 399–419 |
Sách, tạp chí |
Tiêu đề: |
Large neighborhood search |
Tác giả: |
David Pisinger and Stefan Ropke. “Large neighborhood search”. In |
Năm: |
2010 |
|
[17] Anupama Potluri and Alok Singh. “Hybrid metaheuristic algorithms for minimum weight dominating set”. inApplied Soft Computing: 13.1 (2013), pages 76 –88 |
Sách, tạp chí |
Tiêu đề: |
Hybrid metaheuristic algorithms for minimum weight dominating set |
Tác giả: |
Anupama Potluri and Alok Singh. “Hybrid metaheuristic algorithms for minimum weight dominating set”. inApplied Soft Computing: 13.1 |
Năm: |
2013 |
|
[18] Mritunjay Rai, Shekhar Verma and Shashikala Tapaswi.“A power aware minimum connected dominating set for wireless sensor networks.” In J |
Sách, tạp chí |
Tiêu đề: |
A power aware minimum connected dominating set for wireless sensor networks |
|
[19] Dana SIMIAN Raka JOVANOVIC Milan TUBA. “Ant colony optimization applied to minimum weight dominating set problem”.inProceedings of the 12th WSEAS International Conference on Automatic Control, Modelling & Simulation, Catania, Italy: 2010, pages 29–31 |
Sách, tạp chí |
Tiêu đề: |
Ant colony optimization applied to minimum weight dominating set problem |
|
[20] Paul Shaw. “Using constraint programming and local search methods to solve vehicle routing problems”. InInternational conference on principles and practice of constraint programming:Springer.1998, pages 417–431 |
Sách, tạp chí |
Tiêu đề: |
Using constraint programming and local search methods to solve vehicle routing problems |
|
[21] Chao Shen and Tao Li. “Multi-document summarization via the minimum dominating set”. InProceedings of the 23rd International Conference on Computational Linguistics (Coling 2010): 2010, pages 984–992 |
Sách, tạp chí |
Tiêu đề: |
Multi-document summarization via the minimum dominating set |
|