Analysis and Discussion of Radar Construction Problems with Greedy Algorithm

Jiang, Wenrong

doi:10.1007/978-981-13-6861-5_26

Wenrong Jiang¹⁸

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 924))

1154 Accesses
1 Citations

Abstract

Greedy Algorithm always makes the best choice at moment. In other words, without considering the overall optimality, what it has done is a partial optimal in a situation. The Greedy Algorithm is not the best solution for all problems. For the issues involved in this paper, the advantage of greedy algorithm is more correct and the choice of greedy strategy is only relevant to the current state.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 169.00; Price excludes VAT (USA)

Softcover Book: USD 219.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

Jiang, W., Chen, J., Tao W.: The development of automotive interior sales website. Commun Comput. Inf. Sci. 268(12), 342–348 (2011). EI:20122015019844
Google Scholar
Zhang, D.: Algorithm design and analysis [M], p. 108. National Defense Industry Press, Beijing (2009)
Google Scholar
AC_hell.POJ-1328Intervalgreedy, geometry[EB/OL], 26 Apr 2016. https://blog.csdn.net/AC_hell/article/details/51250550
lbcab. Introduction and use of greedy algorithms [EB/OL], 8 May 2016. https://blog.csdn.net/lbcab/article/details/51347458
Evil Cattle. Theory of greedy algorithm details [EB/OL], 27 Nov 2017. https://www.2cto.com/kf/201711/700882.html
George, B., Valeva, A.: A database security course on a shoestring. In: ACM SIGCSE Bulletin, Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education SIGCSE’06, 38(1): 7–11, (2006)
Google Scholar
Jiang, W., He, S.: The research of small and medium-sized wedding photography enterprise’s product types and consumer participation behavior. In: Proceedings of the 2016 International Conference on Social Science, Humanities and Modern Education(SSHME 2016). Atlantis Press, Guangzhou, China, 30 May 2016, 103-107.WOS:000390400800020
Google Scholar

Download references

Acknowledgements

This work is supported by the Key Disciplines of Computer Science and Technology of Shanghai Polytechnic University under Grant No. XXKZD1604 [7].

Author information

Authors and Affiliations

The School of Computer and Information, Shanghai Polytechnic University, Shanghai, 201209, China
Wenrong Jiang

Authors

Wenrong Jiang
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenrong Jiang .

Editor information

Editors and Affiliations

Department of Mathematics and Computer Science, University of Missouri–St. Louis, St. Louis, MO, USA
Sanjiv K. Bhatia
CSED, ABES Engineering College, Ghaziabad, Uttar Pradesh, India
Shailesh Tiwari
Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, Uttar Pradesh, India
Krishn K. Mishra
Department of Information Technology, Rajkiya Engineering College, Azamgarh, Uttar Pradesh, India
Munesh C. Trivedi

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Jiang, W. (2019). Analysis and Discussion of Radar Construction Problems with Greedy Algorithm. In: Bhatia, S., Tiwari, S., Mishra, K., Trivedi, M. (eds) Advances in Computer Communication and Computational Sciences. Advances in Intelligent Systems and Computing, vol 924. Springer, Singapore. https://doi.org/10.1007/978-981-13-6861-5_26

Download citation

DOI: https://doi.org/10.1007/978-981-13-6861-5_26
Published: 22 May 2019
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6860-8
Online ISBN: 978-981-13-6861-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)

Publish with us

Policies and ethics