Atnaujinkite slapukų nuostatas

El. knyga: Algorithmic Aspects in Information and Management: 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings

Edited by , Edited by , Edited by

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

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.

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