Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Aspects in Information and Management: 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings de Zhao Zhang

Algorithmic Aspects in Information and Management: 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12290

Editat de Zhao Zhang, Wei Li, Ding-Zhu Du
en Limba Engleză Paperback – 9 aug 2020
This volume constitutes the proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management, AAIM 2020, held in Jinhua, China in August 2020.
The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world applications associated with information and management analysis, modeling and data mining. Special considerations are given to algorithmic research that was motivated by real-world applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34301 lei

Preț vechi: 42877 lei
-20% Nou

Puncte Express: 515
Preț estimativ în valută:
6565€ • 6819$ • 5453£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030576011
ISBN-10: 3030576019
Pagini: 640
Ilustrații: XI, 640 p. 151 illus., 61 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.9 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.- Selfish 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.