Optimal RSUs placement with delay bounded message dissemination in vehicular networks
From MaRDI portal
Publication:2012886
DOI10.1007/s10878-016-0034-8zbMath1376.90070OpenAlexW2410232439MaRDI QIDQ2012886
Hejiao Huang, Hongwei David Du, Xiao-Hua Jia, Chun Yan Liu
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0034-8
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (1)
Cites Work
- Unnamed Item
- Advances in computer science and information technology. AST/UCMA/ISA/ACN 2010 conferences, Miyazaki, Japan, June 23--25, 2010. Joint proceedings
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- An algorithm for set covering problem
- Greedy approximations for minimum submodular cover with submodular cost
- Combinatorial Auctions: A Survey
- A threshold of ln n for approximating set cover
This page was built for publication: Optimal RSUs placement with delay bounded message dissemination in vehicular networks