Minimum Weight Problems for VANET Special Nodes
碩士 === 國立清華大學 === 通訊工程研究所 === 99 === In this paper, we define four optimization problems according to various topology configurations in VANET. Furthermore, we give the NP-completeness proof for three of these problems, and proof that one is in polynomial time. We proposed two approaches for P-solva...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/79005767713697171739 |