Información del autor
Autor Du, Ding-Zhu |
Documentos disponibles escritos por este autor (8)
Crear una solicitud de compra Refinar búsqueda12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / Tang, Shaojie ; Du, Ding-Zhu ; Woodruff, David ; Butenko, Sergiy
TÃtulo : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings Tipo de documento: documento electrónico Autores: Tang, Shaojie, ; Du, Ding-Zhu, ; Woodruff, David, ; Butenko, Sergiy, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2018 Número de páginas: VIII, 320 p. 77 ilustraciones, 31 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-04618-7 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 Algoritmos Análisis numérico Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos Clasificación: Resumen: Este volumen constituye las actas de la 12.ª Conferencia Internacional sobre Aspectos AlgorÃtmicos en la Información y la Gestión, AAIM 2018, celebrada en Dallas, Texas, EE. UU., en diciembre de 2018. Los 25 artÃculos completos presentados fueron cuidadosamente revisados ​​y seleccionados. Los artÃculos abordan las tendencias actuales de investigación sobre algoritmos, estructuras de datos, investigación operativa, optimización combinatoria y sus aplicaciones. Nota de contenido: Minimum Diameter $k$-Steiner Forest -- Factors Impacting the Label Denoising of Neural Relation Extraction -- Makespan Minimization on Unrelated Parallel Machines with a Few Bags -- Channel Assignment with r-Dynamic Coloring -- Profit Maximization Problem with Coupons in Social Networks -- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem -- A Novel Approach to Verifying Context Free Properties of Programs -- Determination of Dual Distances for a Kind of Perfect Mixed Codes -- Approximation and Competitive Algorithms for Single-Minded Selling Problem -- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints -- Quality-aware Online Task Assignment Using Latent Topic Model -- Calibration Scheduling with Time Slot Cost -- The k-power domination problem in weighted trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network -- Faster Compression of Patterns to Rectangle Rule Lists -- Algorithm Designs for Dynamic Ridesharing System -- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems -- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces -- Order preserving barrier coverage with weighted sensors on a line -- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing -- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem -- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory -- Community-based Acceptance Probability Maximization for Target Users on Social Networks -- Knowledge Graph Embedding Based on Subgraph-aware Proximity. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings [documento electrónico] / Tang, Shaojie, ; Du, Ding-Zhu, ; Woodruff, David, ; Butenko, Sergiy, . - 1 ed. . - [s.l.] : Springer, 2018 . - VIII, 320 p. 77 ilustraciones, 31 ilustraciones en color.
ISBN : 978-3-030-04618-7
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 Algoritmos Análisis numérico Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos Clasificación: Resumen: Este volumen constituye las actas de la 12.ª Conferencia Internacional sobre Aspectos AlgorÃtmicos en la Información y la Gestión, AAIM 2018, celebrada en Dallas, Texas, EE. UU., en diciembre de 2018. Los 25 artÃculos completos presentados fueron cuidadosamente revisados ​​y seleccionados. Los artÃculos abordan las tendencias actuales de investigación sobre algoritmos, estructuras de datos, investigación operativa, optimización combinatoria y sus aplicaciones. Nota de contenido: Minimum Diameter $k$-Steiner Forest -- Factors Impacting the Label Denoising of Neural Relation Extraction -- Makespan Minimization on Unrelated Parallel Machines with a Few Bags -- Channel Assignment with r-Dynamic Coloring -- Profit Maximization Problem with Coupons in Social Networks -- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem -- A Novel Approach to Verifying Context Free Properties of Programs -- Determination of Dual Distances for a Kind of Perfect Mixed Codes -- Approximation and Competitive Algorithms for Single-Minded Selling Problem -- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints -- Quality-aware Online Task Assignment Using Latent Topic Model -- Calibration Scheduling with Time Slot Cost -- The k-power domination problem in weighted trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network -- Faster Compression of Patterns to Rectangle Rule Lists -- Algorithm Designs for Dynamic Ridesharing System -- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems -- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces -- Order preserving barrier coverage with weighted sensors on a line -- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing -- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem -- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory -- Community-based Acceptance Probability Maximization for Target Users on Social Networks -- Knowledge Graph Embedding Based on Subgraph-aware Proximity. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
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 Clasificación: 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 Veriï¬cation of Geometric Theorems -- Approximating Closest Vector Problem in inï¬nte 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 -- Proï¬t 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 ï¬xed 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 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 Clasificación: 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 Veriï¬cation of Geometric Theorems -- Approximating Closest Vector Problem in inï¬nte 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 -- Proï¬t 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 ï¬xed 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
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 Clasificación: 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 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 Clasificación: 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings Tipo de documento: documento electrónico Autores: Du, Ding-Zhu, ; Du, Donglei, ; Wu, Chenchen, ; Xu, Dachuan, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2021 Número de páginas: XIII, 714 p. 138 ilustraciones, 50 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-92681-6 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: Ciencias de la Computación Estructuras de datos (Informática) TeorÃa de la información Informática Inteligencia artificial Gráficos de computadora TeorÃa de la Computación Estructuras de datos y teorÃa de la información Matemáticas de la Computación Clasificación: Resumen: Este libro constituye las actas arbitradas de la 15.ª Conferencia Internacional Anual sobre Optimización Combinatoria y Aplicaciones, COCOA 2021, que tuvo lugar en Tianjin, China, del 17 al 19 de diciembre de 2021. Los 55 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados de 122 presentaciones. Tratan sobre la optimización combinatoria y sus aplicaciones en general, centrándose en el diseño de algoritmos, el análisis teórico y experimental y la investigación aplicada de interés algorÃtmico general. Nota de contenido: Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings [documento electrónico] / Du, Ding-Zhu, ; Du, Donglei, ; Wu, Chenchen, ; Xu, Dachuan, . - 1 ed. . - [s.l.] : Springer, 2021 . - XIII, 714 p. 138 ilustraciones, 50 ilustraciones en color.
ISBN : 978-3-030-92681-6
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Palabras clave: Ciencias de la Computación Estructuras de datos (Informática) TeorÃa de la información Informática Inteligencia artificial Gráficos de computadora TeorÃa de la Computación Estructuras de datos y teorÃa de la información Matemáticas de la Computación Clasificación: Resumen: Este libro constituye las actas arbitradas de la 15.ª Conferencia Internacional Anual sobre Optimización Combinatoria y Aplicaciones, COCOA 2021, que tuvo lugar en Tianjin, China, del 17 al 19 de diciembre de 2021. Los 55 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados de 122 presentaciones. Tratan sobre la optimización combinatoria y sus aplicaciones en general, centrándose en el diseño de algoritmos, el análisis teórico y experimental y la investigación aplicada de interés algorÃtmico general. Nota de contenido: Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : 25th International Conference, COCOON 2019, Xi'an, China, July 29–31, 2019, Proceedings Tipo de documento: documento electrónico Autores: Du, Ding-Zhu, ; Duan, Zhenhua, ; Tian, Cong, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: XIII, 678 p. 493 ilustraciones, 35 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-26176-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: Algoritmos Informática Matemáticas discretas Inteligencia artificial Análisis numérico Gráficos de computadora Matemáticas discretas en informática Ciencia de los datos Clasificación: Resumen: Este libro constituye las actas de la 25.ª Conferencia Internacional sobre Computación y Combinatoria, COCOON 2019, celebrada en Xi''an, China, en julio de 2019. Los 55 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 124 presentaciones. Los artÃculos cubren varios temas, incluido el diseño de algoritmos, algoritmo de aproximación, teorÃa de grafos, teorÃa de la complejidad, resolución de problemas, optimización, biologÃa computacional, aprendizaje computacional, redes de comunicación, lógica y teorÃa de juegos. Nota de contenido: Algorithm design -- Approximation algorithm -- Graph theory -- Complexity theory -- Problem solving -- Optimization -- Computational biology -- Computational learning -- Communication network -- Logic -- Game theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 25th International Conference, COCOON 2019, Xi'an, China, July 29–31, 2019, Proceedings [documento electrónico] / Du, Ding-Zhu, ; Duan, Zhenhua, ; Tian, Cong, . - 1 ed. . - [s.l.] : Springer, 2019 . - XIII, 678 p. 493 ilustraciones, 35 ilustraciones en color.
ISBN : 978-3-030-26176-4
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Palabras clave: Algoritmos Informática Matemáticas discretas Inteligencia artificial Análisis numérico Gráficos de computadora Matemáticas discretas en informática Ciencia de los datos Clasificación: Resumen: Este libro constituye las actas de la 25.ª Conferencia Internacional sobre Computación y Combinatoria, COCOON 2019, celebrada en Xi''an, China, en julio de 2019. Los 55 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 124 presentaciones. Los artÃculos cubren varios temas, incluido el diseño de algoritmos, algoritmo de aproximación, teorÃa de grafos, teorÃa de la complejidad, resolución de problemas, optimización, biologÃa computacional, aprendizaje computacional, redes de comunicación, lógica y teorÃa de juegos. Nota de contenido: Algorithm design -- Approximation algorithm -- Graph theory -- Complexity theory -- Problem solving -- Optimization -- Computational biology -- Computational learning -- Communication network -- Logic -- Game theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
