LEADER 03795nam 22005535 450 001 9910380748603321 005 20230329225557.0 010 $a3-030-41672-0 024 7 $a10.1007/978-3-030-41672-0 035 $a(CKB)4100000010480271 035 $a(DE-He213)978-3-030-41672-0 035 $a(MiAaPQ)EBC6120872 035 $a(PPN)24297922X 035 $a(EXLCZ)994100000010480271 100 $a20200220d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComplexity and Approximation $eIn Memory of Ker-I Ko /$fedited by Ding-Zhu Du, Jie Wang 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (X, 289 p. 42 illus., 25 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12000 300 $aIncludes index. 311 $a3-030-41671-2 327 $aIn Memoriam: Ker-I Ko (1950-2018) -- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity -- The Power of Self-Reducibility Selectivity, Information, and Approximation -- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis -- Promise Problems on Probability Distributions -- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets -- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation -- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents -- Better Upper Bounds for Searching on a Line with Byzantine Robots -- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions -- Sequential Location Game on Continuous Directional Star Networks -- Core Decomposition, Maintenance and Applications -- Active and Busy Time Scheduling Problem: a Survey -- A Note on the Position Value for Hypergraph Communication Situations -- An Efficient Approximation Algorithm for the Steiner Tree Problem -- A Review for Submodular Optimization on Machine Scheduling Problems -- Edge Computing Integrated with Blockchain Technologies. 330 $aThis Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed signi?cantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12000 606 $aAlgorithms 606 $aMathematics 606 $aAlgorithms 606 $aApplications of Mathematics 615 0$aAlgorithms. 615 0$aMathematics. 615 14$aAlgorithms. 615 24$aApplications of Mathematics. 676 $a005.1 676 $a519.3 702 $aDu$b Ding-Zhu$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWang$b Jie$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910380748603321 996 $aComplexity and approximation$9245498 997 $aUNINA