Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Frontiers in Algorithmics [[electronic resource] ] : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu
| Frontiers in Algorithmics [[electronic resource] ] : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 183 p. 83 illus., 19 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Artificial intelligence Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-18126-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . |
| Record Nr. | UNISA-996466303103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu
| Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / / edited by Yijia Chen, Xiaotie Deng, Mei Lu |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 183 p. 83 illus., 19 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Artificial intelligence Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-18126-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . |
| Record Nr. | UNINA-9910337854103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||