| Description |
1 online resource (x, 183 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 11458 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 11458.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
1. A polynomial time algorithm for fair resource allocation in resource exchange / Xiang Yan, Wei Zhu -- 2. A local search 4/3-approximation algorithm for the minimum 3-path partition problem / Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang -- 3. Efficient guarding of polygons and terrains / Pradeesha Ashok, Meghana M. Reddy -- 4. Graph orientation with edge modifications / Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T.P. -- 5. Local coloring : new observations and new reductions / Jie You, Yixin Cao, Jianxin Wang -- 6. Secure computation of any Boolean function based on any deck of cards / Kazumasa Shinagawa, Takaaki Mizuki -- 7. A novel business model for electric car sharing / Yukun Cheng, Xiaotie Deng, Mengqian Zhang -- 8. Constructing three completely independent spanning trees in locally twisted cubes / Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu -- 9. Read-once resolutions in horn formulas / Hans Kleine Büning, P. Wojciechowski, K. Subramani -- 10. Vertex-critical (P5, banner)-free graphs / Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi -- 11. An FPTAS for stochastic unbound min-knapsack problem / Zhihao Jiang, Haoyu Zhao -- 12. The inapproximability of k-DominatingSet for parameterized AC° circuits / Wenxing Lai -- 13. Mutual visibility by robots with persistent memory / Subhash Bhagat, Krishnendu Mukhopadhyaya -- 14. Pushing the online matrix-vector conjecture off-line and identifying its easy cases / Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson -- 15. An improved approximation algorithm for the k-means problem with penalties / Qilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang |
| Summary |
This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. -- Provided by publisher |
| Notes |
International conference proceedings |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed April 22, 2019) |
| Subject |
Computer algorithms -- Congresses
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Chen, Yijia, editor
|
|
Deng, Xiaotie, editor.
|
|
Lu, Mei, editor
|
| ISBN |
9783030181260 |
|
303018126X |
|
3030181251 |
|
9783030181253 |
|
9783030181277 |
|
3030181278 |
|
