Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, ProceedingsThis 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. |
Wat mensen zeggen - Een review schrijven
We hebben geen reviews gevonden op de gebruikelijke plaatsen.
Inhoudsopgave
| 1 | |
A Local Search 43approximation Algorithm for the Minimum 3path Partition Problem | 14 |
Efficient Guarding of Polygons and Terrains | 26 |
Graph Orientation with Edge Modifications | 38 |
New Observations and New Reductions | 51 |
Secure Computation of Any Boolean Function Based on Any Deck of Cards | 63 |
A Novel Business Model for Electric Car Sharing | 76 |
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes | 88 |
VertexCritical P5 bannerFree Graphs | 111 |
An FPTAS for Stochastic Unbounded MinKnapsack Problem | 121 |
The Inapproximability of kDominatingSet for Parameterized AC0 Circuits | 133 |
Mutual Visibility by Robots with Persistent Memory | 144 |
Pushing the Online MatrixVector Conjecture OffLine and Identifying Its Easy Cases | 156 |
An Improved Approximation Algorithm for the kMeans Problem with Penalties | 170 |
| 182 | |
ReadOnce Resolutions in Horn Formulas | 100 |
Overige edities - Alles bekijken
Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya ... Yijia Chen,Xiaotie Deng,Mei Lu Geen voorbeeld beschikbaar - 2019 |
Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya ... Yijia Chen,Xiaotie Deng,Mei Lu Geen voorbeeld beschikbaar - 2019 |
Veelvoorkomende woorden en zinsdelen
3-coloring 3-path partition adjacent allocation approximation algorithm Art Gallery problem bipartite graphs Boolean function Boolean matrix bottleneck decomposition car sharing China chromatic number CISTs clause collinearity coloring conjecture constant-depth circuits construct deck define denote directed graph Discrete dominating set edge-weighted edges Efficient Guarding finite FPTAS given graph G Hamming distance Horn formulas independent spanning trees induced subgraph input integer joint venture k-coloring k-MPWP k-vertex-critical knapsack problem Lemma line of collinearity LNCS locally twisted cubes LTQ6 LTQn Math maximal bottleneck maximum MIN-DEL-MAX Min-SUKP minimum mutual visibility problem node NP-complete NP-hard OC pair operators optimal OPTW perfect graphs persistent memory polygon polynomial polynomial-time preprocessing Proof protocol ratio read-once refutation read-once resolution read-once unit resolution resolution step robot position robots round set cover number solved subgraph subset Theorem token users variable vector vertex vertices visibility graph
Bibliografische gegevens
| Titel | Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings Volume 11458 van Lecture Notes in Computer Science Theoretical Computer Science and General Issues |
| Redacteurs | Yijia Chen, Xiaotie Deng, Mei Lu |
| Uitgever | Springer, 2019 |
| ISBN | 303018126X, 9783030181260 |
| Lengte | 183 pagina's |
| Citatie exporteren | BiBTeX EndNote RefMan |