Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Complexity and Approximation: In Memory of Ker-I Ko

Complexity and Approximation: In Memory of Ker-I Ko

Wang, Jie
Du, Ding-Zhu

Paperback

General MathematicsProgramming

ISBN10: 3030416712
ISBN13: 9783030416713
Publisher: Springer
Published: Feb 21 2020
Pages: 289
Weight: 0.93
Height: 0.63 Width: 6.14 Depth: 9.21
Language: English

In 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.

Also in

Programming

View All