| Título : |
13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Du, Ding-Zhu, ; Li, Lian, ; Sun, Xiaoming, ; Zhang, Jialin, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
IX, 354 p. 67 ilustraciones, 9 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-27195-4 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Informática Matemáticas discretas Análisis numérico Algoritmos Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos |
| Índice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 13.ª Conferencia Internacional sobre Aspectos Algorítmicos en la Información y la Gestión, AAIM 2019, celebrada en Beijing, China, en agosto de 2019. Los 31 artículos completos presentados fueron cuidadosamente revisados y seleccionados. Los artículos abordan la mayoría de los aspectos de la informática teórica y sus aplicaciones. Se dan consideraciones especiales a la investigación algorítmica motivada por aplicaciones del mundo real. . |
| Nota de contenido: |
One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrainedcluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings [documento electrónico] / Du, Ding-Zhu, ; Li, Lian, ; Sun, Xiaoming, ; Zhang, Jialin, . - 1 ed. . - [s.l.] : Springer, 2019 . - IX, 354 p. 67 ilustraciones, 9 ilustraciones en color. ISBN : 978-3-030-27195-4 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Informática Matemáticas discretas Análisis numérico Algoritmos Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos |
| Índice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 13.ª Conferencia Internacional sobre Aspectos Algorítmicos en la Información y la Gestión, AAIM 2019, celebrada en Beijing, China, en agosto de 2019. Los 31 artículos completos presentados fueron cuidadosamente revisados y seleccionados. Los artículos abordan la mayoría de los aspectos de la informática teórica y sus aplicaciones. Se dan consideraciones especiales a la investigación algorítmica motivada por aplicaciones del mundo real. . |
| Nota de contenido: |
One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrainedcluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsqueda13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / Du, Ding-Zhu ; Li, Lian ; Sun, Xiaoming ; Zhang, Jialin
