Complexity and Approximation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

17

(FIVE YEARS 17)

H-INDEX

1

(FIVE YEARS 1)

Published By Springer International Publishing

9783030416713, 9783030416720

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_6 ◽

2020 ◽

pp. 67-79

Author(s):

Shuichi Hirahara ◽

Osamu Watanabe

Download Full-text

Promise Problems on Probability Distributions

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_5 ◽

2020 ◽

pp. 57-66

Author(s):

Jan-Hendrik Lorenz ◽

Uwe Schöning

Keyword(s):

Probability Distributions ◽

Promise Problems

Download Full-text

Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_2 ◽

2020 ◽

pp. 8-18

Author(s):

Eric Allender

Keyword(s):

Kolmogorov Complexity

Download Full-text

Edge Computing Integrated with Blockchain Technologies

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_17 ◽

2020 ◽

pp. 268-288 ◽

Author(s):

Chuanwen Luo ◽

Liya Xu ◽

Deying Li ◽

Weili Wu

Keyword(s):

Download Full-text

A Note on the Position Value for Hypergraph Communication Situations

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_14 ◽

2020 ◽

pp. 230-237 ◽

Author(s):

Erfang Shan ◽

Jilei Shi ◽

Wenrong Lv

Keyword(s):

Position Value ◽

Communication Situations

Download Full-text

Active and Busy Time Scheduling Problem: A Survey

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_13 ◽

2020 ◽

pp. 219-229

Author(s):

Vincent Chau ◽

Minming Li

Keyword(s):

Scheduling Problem ◽

Busy Time ◽

Time Scheduling

Download Full-text

A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_10 ◽

2020 ◽

pp. 172-186

Author(s):

Qingqin Nong ◽

Suning Gong ◽

Qizhi Fang ◽

Dingzhu Du

Keyword(s):

Greedy Algorithms ◽

Submodular Functions

Download Full-text

An Efficient Approximation Algorithm for the Steiner Tree Problem

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_15 ◽

2020 ◽

pp. 238-251 ◽

Author(s):

Chi-Yeh Chen ◽

Sun-Yuan Hsieh

Keyword(s):

Approximation Algorithm ◽

Steiner Tree ◽

Steiner Tree Problem ◽

Efficient Approximation Algorithm ◽

Efficient Approximation

Download Full-text

Core Decomposition, Maintenance and Applications

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_12 ◽

2020 ◽

pp. 205-218

Author(s):

Feiteng Zhang ◽

Bin Liu ◽

Qizhi Fang

Download Full-text

Sequential Location Game on Continuous Directional Star Networks

Complexity and Approximation - Lecture Notes in Computer Science ◽

10.1007/978-3-030-41672-0_11 ◽

2020 ◽

pp. 187-204

Author(s):

Xujin Chen ◽

Xiaodong Hu ◽

Mengqi Zhang

Keyword(s):

Download Full-text