{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":27,"n_cols":5,"rows_kept":27,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[21,2,21,3],[22,2,22,3],[24,2,24,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910513582803321"]
[null,null,"Titolo",null,"Algorithmic Aspects in Information and Management : 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / / edited by Weili Wu, Hongwei Du"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021"]
[null,null,"ISBN",null,"3-030-93176-5"]
[null,null,"Edizione",null,"[1st ed. 2021.]"]
[null,null,"Descrizione fisica",null,"1 online resource (456 pages)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 13153"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Image processing - Digital techniques"]
[{"$nulls":4},"Computer vision"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Imaging, Vision, Pattern Recognition and Graphics"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Numerical Analysis"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling "]
[{"$nulls":4},"with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences -Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge."]
[null,null,null,"Sommario/riassunto","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. ."]