000913402 000__ 04906cam\a2200565Ii\4500
000913402 001__ 913402
000913402 005__ 20230306150427.0
000913402 006__ m\\\\\o\\d\\\\\\\\
000913402 007__ cr\cn\nnnunnun
000913402 008__ 190829s2019\\\\sz\a\\\\ob\\\\101\0\eng\d
000913402 019__ $$a1117284203$$a1117706516
000913402 020__ $$a9783030271954$$q(electronic book)
000913402 020__ $$a3030271951$$q(electronic book)
000913402 020__ $$z9783030271947
000913402 020__ $$a3030271943
000913402 020__ $$a9783030271947
000913402 0247_ $$a10.1007/978-3-030-27195-4$$2doi
000913402 0247_ $$a10.1007/978-3-030-27
000913402 035__ $$aSP(OCoLC)on1114329154
000913402 035__ $$aSP(OCoLC)1114329154$$z(OCoLC)1117284203$$z(OCoLC)1117706516
000913402 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dLQU$$dUPM$$dMNU$$dUKMGB
000913402 049__ $$aISEA
000913402 050_4 $$aQA76.9.A43
000913402 08204 $$a005.1$$223
000913402 1112_ $$aAAIM (Conference)$$n(13th :$$d2019 :$$cBeijing, China)
000913402 24510 $$aAlgorithmic aspects in information and management :$$b13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings /$$cDing-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang (eds.).
000913402 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2019]
000913402 300__ $$a1 online resource (ix, 354 pages) :$$billustrations
000913402 336__ $$atext$$btxt$$2rdacontent
000913402 337__ $$acomputer$$bc$$2rdamedia
000913402 338__ $$aonline resource$$bcr$$2rdacarrier
000913402 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v11640
000913402 4901_ $$aLNCS sublibrary: SL 1, Theoretical computer science and general issues
000913402 504__ $$aIncludes bibliographical references and index.
000913402 5050_ $$aOne-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte 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 -- Profit 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 constrained cluster 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 fixed 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 t he Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem.
000913402 506__ $$aAccess limited to authorized users.
000913402 520__ $$aThis volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019. The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
000913402 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 29, 2019).
000913402 650_0 $$aComputer algorithms$$vCongresses.
000913402 650_0 $$aManagement science$$xData processing$$vCongresses.
000913402 7001_ $$aDu, Ding-Zhu,$$eeditor.
000913402 7001_ $$aLi, Lian,$$eeditor.
000913402 7001_ $$aSun, Xiaoming,$$eeditor.
000913402 7001_ $$aZhang, Jialin,$$eeditor.
000913402 830_0 $$aLecture notes in computer science ;$$v11640.
000913402 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000913402 852__ $$bebk
000913402 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-27195-4$$zOnline Access$$91397441.1
000913402 909CO $$ooai:library.usi.edu:913402$$pGLOBAL_SET
000913402 980__ $$aEBOOK
000913402 980__ $$aBIB
000913402 982__ $$aEbook
000913402 983__ $$aOnline
000913402 994__ $$a92$$bISE