001441380 000__ 06321cam\a2200709\a\4500
001441380 001__ 1441380
001441380 003__ OCoLC
001441380 005__ 20230309004735.0
001441380 006__ m\\\\\o\\d\\\\\\\\
001441380 007__ cr\un\nnnunnun
001441380 008__ 220101s2021\\\\sz\\\\\\o\\\\\101\0\eng\d
001441380 019__ $$a1289443264$$a1289479946$$a1289536482$$a1289608729$$a1290023201$$a1292518926$$a1294359310
001441380 020__ $$a9783030931766$$q(electronic bk.)
001441380 020__ $$a3030931765$$q(electronic bk.)
001441380 020__ $$z9783030931759$$q(print)
001441380 020__ $$z3030931757
001441380 0247_ $$a10.1007/978-3-030-93176-6$$2doi
001441380 035__ $$aSP(OCoLC)1290483947
001441380 040__ $$aEBLCP$$beng$$epn$$cEBLCP$$dGW5XE$$dDKU$$dYDX$$dOCLCO$$dDCT$$dOCLCF$$dOCLCO$$dCOM$$dOCLCO$$dOCLCQ
001441380 049__ $$aISEA
001441380 050_4 $$aQA76.9.A43
001441380 08204 $$a005.1$$223
001441380 1112_ $$aInternational Conference on Algorithmic Aspects in Information and Management$$n(15th :$$d2021 :$$cOnline)
001441380 24510 $$aAlgorithmic aspects in information and management :$$b15th International Conference, AAIM 2021, Virtual event, December 20-22, 2021, Proceedings /$$cWeili Wu, Hongwei Du (eds.).
001441380 2463_ $$aAAIM 2021
001441380 260__ $$aCham, Switzerland :$$bSpringer,$$c2021.
001441380 300__ $$a1 online resource (456 pages)
001441380 336__ $$atext$$btxt$$2rdacontent
001441380 337__ $$acomputer$$bc$$2rdamedia
001441380 338__ $$aonline resource$$bcr$$2rdacarrier
001441380 347__ $$atext file
001441380 347__ $$bPDF
001441380 4901_ $$aLecture notes in computer science ;$$v13153
001441380 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001441380 500__ $$a3.1 Column Generation.
001441380 500__ $$aIncludes author index.
001441380 5050_ $$aIntro -- Preface -- Organization -- Contents -- Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Problem Formulation and Preliminaries -- 3 A Primal-Dual Algorithm for PCFk -- 4 5-LMP for PCMSSC -- 5 Conclusion and Future Work -- References -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- 1 Introduction -- 2 Preliminaries -- 3 Bi-criteria Approximation Algorithm and Analysis
001441380 5058_ $$a3.1 Bi-criteria Approximation Algorithm -- 3.2 Theoretical Analysis -- 4 Conclusions -- References -- Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem -- 1 Introduction -- 2 Preliminaries -- 3 2-BCBP -- 4 2-BCBP on an Interval Graph -- 5 Conclusion -- References -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- 1 Introduction -- 2 Terminologies and Fundamental Lemmas -- 3 The Heterogeneous Chinese Postman Problem -- 4 Conclusion and Further Work -- References -- On Stochastic k-Facility Location -- 1 Preliminaries
001441380 5058_ $$a2 Main Results -- References -- The Complexity of Finding a Broadcast Center -- 1 Introduction -- 2 Preliminaries -- 3 NP-Hardness of BCD -- 4 NP-Hardness of BCS -- 5 Properties of BC -- 6 Conclusion and Future Works -- References -- An Online Algorithm for Data Caching Problem in Edge Computing -- 1 Introduction -- 2 Related Work -- 3 System Model -- 4 Model Analysis -- 5 Conclusion and Future Work -- References -- Scheduling -- Scheduling on Multiple Two-Stage Flowshops with a Deadline -- 1 Introduction -- 2 Preliminaries and Simple Facts -- 3 A Fast 4-Approximation Algorithm for MFL2-Packing
001441380 5058_ $$a4 MFL2-Packing and Multiple-Knapsack -- 5 A (2+)-Approximation for mMFL2-Packing -- References -- Single Machine Scheduling with Rejection to Minimize the Weighted Makespan -- 1 Introduction -- 1.1 Scheduling with Rejection -- 1.2 Scheduling to Minimize the Weighted Makespan -- 2 Problem Formulation -- 3 NP-Hardness Proof -- 4 Dynamic Programming Algorithm -- 5 Approximation Algorithms -- 5.1 A 2-Approximation Algorithm -- 5.2 A Fully Polynomial-Time Approximation Scheme -- 6 Discussions on Some Special Cases -- 6.1 Problem 1^np=k^WCmax+JjRej -- 6.2 Problem 1^np=k^WCmax+JjRej
001441380 5058_ $$a6.3 Problem 1^np=k^WCmax+JjRej -- 6.4 Problem 1^np=k^WCmax+JjRej -- 7 Conclusions and Future Research -- References -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- 1 Introduction -- 2 System Model and Problem Formulation -- 2.1 Network Model -- 2.2 Energy Consumption Model -- 2.3 Problem Formulation -- 3 Algorithms for CS-MEE Problem -- 4 Simulation Results -- 5 Conclusion -- References -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- 1 Introduction -- 2 Problem Description for DARSP -- 3 Branch-and-Price Strategies
001441380 506__ $$aAccess limited to authorized users.
001441380 520__ $$aThis book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous.
001441380 650_0 $$aComputer algorithms$$vCongresses.
001441380 650_0 $$aManagement science$$xData processing$$vCongresses.
001441380 650_6 $$aAlgorithmes$$vCongrès.
001441380 650_6 $$aSciences de la gestion$$xInformatique$$vCongrès.
001441380 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001441380 655_7 $$aConference papers and proceedings.$$2lcgft
001441380 655_7 $$aActes de congrès.$$2rvmgf
001441380 655_0 $$aElectronic books.
001441380 7001_ $$aWu, Weili.
001441380 7001_ $$aDu, Hongwei.
001441380 77608 $$iPrint version:$$aWu, Weili.$$tAlgorithmic Aspects in Information and Management.$$dCham : Springer International Publishing AG, ©2022$$z9783030931759
001441380 830_0 $$aLecture notes in computer science ;$$v13153.
001441380 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001441380 852__ $$bebk
001441380 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-93176-6$$zOnline Access$$91397441.1
001441380 909CO $$ooai:library.usi.edu:1441380$$pGLOBAL_SET
001441380 980__ $$aBIB
001441380 980__ $$aEBOOK
001441380 982__ $$aEbook
001441380 983__ $$aOnline
001441380 994__ $$a92$$bISE