000 07369nam a22006255i 4500
001 978-3-030-57602-8
003 DE-He213
005 20240730174748.0
007 cr nn 008mamaa
008 200809s2020 sz | s |||| 0|eng d
020 _a9783030576028
_9978-3-030-57602-8
024 7 _a10.1007/978-3-030-57602-8
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithmic Aspects in Information and Management
_h[electronic resource] :
_b14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings /
_cedited by Zhao Zhang, Wei Li, Ding-Zhu Du.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXI, 640 p. 151 illus., 61 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12290
505 0 _aPolynomial-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.
520 _aThis 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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aData mining.
_93907
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aData Mining and Knowledge Discovery.
_9113965
700 1 _aZhang, Zhao.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9113966
700 1 _aLi, Wei.
_eeditor.
_0(orcid)
_10000-0002-8833-9396
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9113967
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9113968
710 2 _aSpringerLink (Online service)
_9113969
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030576011
776 0 8 _iPrinted edition:
_z9783030576035
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12290
_9113970
856 4 0 _uhttps://doi.org/10.1007/978-3-030-57602-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89609
_d89609