|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
on1290483947 |
| 003 |
OCoLC |
| 005 |
20241006213017.0 |
| 006 |
m o d |
| 007 |
cr un|---aucuu |
| 008 |
220101s2021 sz o 101 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d GW5XE
|d DKU
|d YDX
|d OCLCO
|d DCT
|d OCLCF
|d OCLCO
|d COM
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 1289443264
|a 1289479946
|a 1289536482
|a 1289608729
|a 1290023201
|a 1292518926
|a 1294359310
|
| 020 |
|
|
|a 9783030931766
|q (electronic bk.)
|
| 020 |
|
|
|a 3030931765
|q (electronic bk.)
|
| 020 |
|
|
|z 9783030931759
|q (print)
|
| 020 |
|
|
|z 3030931757
|
| 024 |
7 |
|
|a 10.1007/978-3-030-93176-6
|2 doi
|
| 035 |
|
|
|a (OCoLC)1290483947
|z (OCoLC)1289443264
|z (OCoLC)1289479946
|z (OCoLC)1289536482
|z (OCoLC)1289608729
|z (OCoLC)1290023201
|z (OCoLC)1292518926
|z (OCoLC)1294359310
|
| 037 |
|
|
|b Springer
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a PBD
|2 thema
|
| 072 |
|
7 |
|a UYAM
|2 thema
|
| 049 |
|
|
|a HCDD
|
| 111 |
2 |
|
|a International Conference on Algorithmic Aspects in Information and Management
|n (15th :
|d 2021 :
|c Online)
|
| 245 |
1 |
0 |
|a Algorithmic aspects in information and management :
|b 15th International Conference, AAIM 2021, Virtual event, December 20-22, 2021, Proceedings /
|c Weili Wu, Hongwei Du (eds.).
|
| 246 |
3 |
|
|a AAIM 2021
|
| 260 |
|
|
|a Cham, Switzerland :
|b Springer,
|c 2021.
|
| 300 |
|
|
|a 1 online resource (456 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|
| 347 |
|
|
|b PDF
|
| 490 |
1 |
|
|a Lecture notes in computer science ;
|v 13153
|
| 490 |
1 |
|
|a LNCS sublibrary, SL 1, Theoretical computer science and general issues
|
| 505 |
0 |
|
|a Intro -- 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
|
| 505 |
8 |
|
|a 3.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
|
| 505 |
8 |
|
|a 2 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
|
| 505 |
8 |
|
|a 4 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
|
| 505 |
8 |
|
|a 6.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
|
| 500 |
|
|
|a 3.1 Column Generation.
|
| 520 |
|
|
|a This 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.
|
| 500 |
|
|
|a Includes author index.
|
| 650 |
|
0 |
|a Computer algorithms
|v Congresses.
|
| 650 |
|
0 |
|a Management science
|x Data processing
|v Congresses.
|
| 650 |
|
7 |
|a Computer algorithms
|2 fast
|
| 650 |
|
7 |
|a Management science
|x Data processing
|2 fast
|
| 655 |
|
7 |
|a proceedings (reports)
|2 aat
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
| 655 |
|
7 |
|a Conference papers and proceedings.
|2 lcgft
|
| 655 |
|
7 |
|a Actes de congrès.
|2 rvmgf
|
| 700 |
1 |
|
|a Wu, Weili.
|
| 700 |
1 |
|
|a Du, Hongwei.
|
| 758 |
|
|
|i has work:
|a Algorithmic aspects in information and management (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCFRcFCmG3XfghGCd63Rjbq
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Wu, Weili.
|t Algorithmic Aspects in Information and Management.
|d Cham : Springer International Publishing AG, ©2022
|z 9783030931759
|
| 830 |
|
0 |
|a Lecture notes in computer science ;
|v 13153.
|
| 830 |
|
0 |
|a LNCS sublibrary.
|n SL 1,
|p Theoretical computer science and general issues.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-3-030-93176-6
|y Click for online access
|
| 903 |
|
|
|a SPRING-COMP2021
|
| 994 |
|
|
|a 92
|b HCD
|