Frontiers in Algorithmics 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings
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 curr...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book Conference Proceeding |
| Language | English |
| Published |
Cham
Springer Nature
2019
Springer Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783030181260 303018126X 3030181251 9783030181253 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-030-18126-0 |
Cover
Table of Contents:
- 2.2 Existing XOR Protocol -- 2.3 Existing Input-Preserving and Protocol -- 2.4 Notations for Various Decks of Cards -- 3 Our Input-Preserving and Protocol -- 3.1 Opaque Commitment Pair -- 3.2 New Technique of Opaque Commitment Pair Generation -- 3.3 Description of Our Input-Preserving AND protocol -- 4 Our Protocol for Any Boolean Function -- 4.1 Swap Protocol -- 4.2 AND-XOR Protocol -- 4.3 Description of Our Protocol for Any Boolean Function -- 5 Conclusion -- References -- A Novel Business Model for Electric Car Sharing -- 1 Introduction -- 2 Preliminaries -- 2.1 System Model -- 2.2 User Scale Model -- 2.3 Demand Model -- 2.4 Profit Model -- 2.5 Game Model -- 3 Equilibrium Analysis -- 3.1 Second Stage: Operator's Profit Maximization -- 3.2 First Stage: Aggregate Profit Maximization -- 4 Numerical Results -- 5 Conclusion -- References -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes -- 1 Introduction -- 2 Locally Twisted Cubes -- 3 An Algorithm to Find Three CISTs of LTQ6 -- 4 Constructing Three CISTs on High-Dimensional LTQn -- 5 Concluding Remarks -- References -- Read-Once Resolutions in Horn Formulas -- 1 Introduction -- 2 Statement of Problems -- 3 The OLROR Problem for Horn Formulas -- 4 The UROR Problem for 2-Horn Formulas -- 5 UROR Copy Complexity of Horn Formulas -- 6 Conclusion -- References -- Vertex-Critical (P5, banner)-Free Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Structure Around a 5-Hole -- 4 The Main Result -- 4.1 Proof of Lemma3 -- 4.2 Proof of Lemma4 -- 4.3 Proof of Lemma5 -- 5 Conclusion -- References -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- 1 Introduction -- 1.1 Related Work -- 1.2 Preliminary -- 2 A Constant Factor Estimation -- 3 FPTAS Under Certain Assumption -- 4 FPTAS in the General Case -- 4.1 Adding Limitations to Strategy
- 4.2 Computing the Summation Distribution of Many Items of the Same Type -- 4.3 Time Complexity -- 5 Conclusions and Further Work -- References -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- 1 Introduction -- 2 Preliminaries -- 3 Introducing Gap to k-SetCover Problem -- 4 Inapproximability of k-DominatingSet -- 5 Conclusions -- References -- Mutual Visibility by Robots with Persistent Memory -- 1 Introduction -- 1.1 Earlier Works -- 1.2 Our Contribution -- 2 Assumptions and Notations -- 3 Algorithm for the Mutual Visibility Problem -- 3.1 Eligible Robots for Movements -- 3.2 Different Types of Movements -- 3.3 States of a Robot -- 3.4 Computation of Destination Point -- 3.5 Termination -- 3.6 Correctness -- 4 Conclusion -- References -- Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases -- 1 Introduction -- 2 An Off-Line Conjecture -- 3 Easy Cases of Matrices and Vectors for the Conjectures -- 3.1 Small Spanning Tree of the Rows of the Matrix (Warming Up) -- 3.2 Small Spanning Tree of the Input Vectors -- 4 Applications to Graph Queries -- 5 Final Remarks -- References -- An Improved Approximation Algorithm for the k-Means Problem with Penalties -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 3 The Algorithm -- 3.1 A Fractional Solution for the Discrete k-MPWP -- 3.2 Rounding -- References -- Author Index
- Intro -- Preface -- Organization -- Contents -- A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- 1 Introduction -- 2 Preliminary -- 3 Computation of Bottleneck Decomposition -- 3.1 Evaluating the Minimal -ratio * -- 3.2 Finding the Maximal Bottleneck -- 4 Bottleneck Decomposition, Market Equilibrium and Fair Allocation -- 5 Conclusion -- References -- A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem -- 1 Introduction -- 2 A Local Search Approximation Algorithm -- 2.1 Local Operations and Their Priorities -- 2.2 The Complete Local Search Algorithm Approx -- 3 Analysis of the Approximation Ratio 4/3 -- 3.1 Token Distribution Phase 1 -- 3.2 Token Distribution Phase 2 -- 3.3 A Tight Instance for Approx -- 4 Conclusions -- References -- Efficient Guarding of Polygons and Terrains -- 1 Introduction -- 2 Preliminaries -- 3 NP-Hardness -- 4 FPT Algorithm for Terrains -- 5 Polynomial Time Algorithms -- References -- Graph Orientation with Edge Modifications -- 1 Introduction -- 1.1 Problem Definitions -- 1.2 Related Work -- 1.3 Our Contributions and Organization of the Paper -- 2 Unweighted Graphs -- 2.1 Using NG to Solve the Problems -- 2.2 Time Complexity of the Algorithms -- 3 Edge-Weighted Graphs -- 3.1 Polynomial-Time Algorithms for Edge-Weighted Trees -- 3.2 Inapproximability for Edge-Weighted Planar Bipartite Graphs -- 4 Concluding Remarks -- References -- Local Coloring: New Observations and New Reductions -- 1 Introduction -- 2 Main Results -- 3 Local 3-Coloring -- 4 Concluding Remarks -- References -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- 1 Introduction -- 1.1 A Deck of Binary Cards -- 1.2 A Deck of Playing Cards -- 1.3 This Work: Any Deck of Cards -- 1.4 Our Result -- 1.5 Related Works -- 2 Preliminaries -- 2.1 Random Bisection Cut