| TÃtulo : |
14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Zhang, Zhao, ; Li, Wei, ; Du, Ding-Zhu, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2020 |
| Número de páginas: |
XI, 640 p. 151 ilustraciones, 61 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-57602-8 |
| 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 Estructuras de datos (Informática) TeorÃa de la información Procesamiento de datos Matemáticas discretas en informática Estructuras de datos y teorÃa de la información MinerÃa de datos y descubrimiento de conocimientos |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 14.ª Conferencia Internacional sobre Aspectos AlgorÃtmicos en la Información y la Gestión, AAIM 2020, celebrada en Jinhua, China, en agosto de 2020. Los 39 artÃculos completos y 17 artÃculos breves presentados fueron cuidadosamente revisados ​​y seleccionados entre 76 presentaciones. Los artÃculos abordan importantes problemas algorÃtmicos emergentes centrándose en los antecedentes fundamentales, el desarrollo tecnológico teórico y las aplicaciones del mundo real asociadas con el análisis de la información y la gestión, el modelado y la minerÃa de datos. Se dan consideraciones especiales a la investigación algorÃtmica motivada por aplicaciones del mundo real. |
| Nota de contenido: |
Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-roundingplus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selï¬sh Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs withlarge girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. |
| 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 |
14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings [documento electrónico] / Zhang, Zhao, ; Li, Wei, ; Du, Ding-Zhu, . - 1 ed. . - [s.l.] : Springer, 2020 . - XI, 640 p. 151 ilustraciones, 61 ilustraciones en color. ISBN : 978-3-030-57602-8 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 Estructuras de datos (Informática) TeorÃa de la información Procesamiento de datos Matemáticas discretas en informática Estructuras de datos y teorÃa de la información MinerÃa de datos y descubrimiento de conocimientos |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este volumen constituye las actas de la 14.ª Conferencia Internacional sobre Aspectos AlgorÃtmicos en la Información y la Gestión, AAIM 2020, celebrada en Jinhua, China, en agosto de 2020. Los 39 artÃculos completos y 17 artÃculos breves presentados fueron cuidadosamente revisados ​​y seleccionados entre 76 presentaciones. Los artÃculos abordan importantes problemas algorÃtmicos emergentes centrándose en los antecedentes fundamentales, el desarrollo tecnológico teórico y las aplicaciones del mundo real asociadas con el análisis de la información y la gestión, el modelado y la minerÃa de datos. Se dan consideraciones especiales a la investigación algorÃtmica motivada por aplicaciones del mundo real. |
| Nota de contenido: |
Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-roundingplus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selï¬sh Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs withlarge girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. |
| 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 |
|  |
14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings
