Algorithmic aspects in information and management : 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings /: 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings. (2020)

• Record Type: Book
• Other Titles: AAIM 2020
• Further Information: Note: Zhao Zhang, Wei Li, Ding-Zhu Du (eds.).
• Editors: (Computer scientist), Zhang, Zhao; Li, Wei; Di, Ding-Zhu
• Other Names: International Conference on Algorithmic Aspects in Information and Management, 14th
• Contents: Intro -- Preface -- Organization -- Contents -- Polynomial-Time Algorithms for the Touring Rays and Related Problems -- 1 Introduction -- 2 Shortest Touring Routes for Rays in the Plane -- 2.1 A Restricted Traveling Salesman Problem for Rays -- 3 The TSP for Rays in the Plane -- 3.1 A Solution of the Restricted TSP for Rays -- 3.2 The Algorithm -- 3.3 Removing the Restriction of a Given Starting Point -- 4 An Application to the Problem MPIP -- References -- Polyhedral Circuits and Their Applications -- 1 Introduction -- 2 Preliminaries -- 3 Algorithms About Polyhedral Circuits 4 Applications -- 4.1 Application in Continuous Polyhedra Maximum Coverage Problem -- 4.2 Application in Polyhedra Maximum Lattice Coverage Problem -- 4.3 Application in Polyhedra (1-)-Lattice Set Cover Problem -- 4.4 Application in (1-)-Continuous Polyhedra Set Cover Problem -- 5 NP-Hardness and Inapproximation -- 6 Conclusions -- References -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- 1 Introduction -- 2 Preliminaries -- 3 Online Algorithms for Maximizing the Difference of -Weakly Submodular and Linear Function 3.1 An Online Algorithm for Maximizing -Weakly Submodular Minus Linear Function (S-L) -- 3.2 An Online Algorithm for Maximizing Strictly -Weakly Submodular Minus Linear Function (SS-L) -- 3.3 A General Online Algorithm for Maximizing -Weakly Submodular Minus Linear Function (GS-L) -- 4 Conclusions -- References -- Approximation Algorithm for Stochastic Set Cover Problem -- 1 Introduction -- 2 Related Work -- 3 Stochastic Set Cover Problem with Submodular Penalties -- 3.1 The Primal-Dual Algorithm -- 3.2 The Analysis of the Algorithm -- 4 Conclusions -- References On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane R2 -- 1 Introduction -- 2 Terminologies and Fundamental Lemmas -- 3 The 1LF-MRST Problem -- 4 The 1L-MRST Problem -- 5 Conclusion and Further Research -- References -- Minimum Diameter Vertex-Weighted Steiner Tree -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Results -- 2 Preliminaries -- 2.1 Notations -- 2.2 Problem Definition -- 3 Parameterized Graphs -- 4 Approximating MDWSTP in ""426830A T, ""526930B -PG -- 4.1 Preliminary Lemmas -- 4.2 An Approximation Algorithm 5 Approximating MDWSTP in (T, )-PG -- 5.1 A Simple Approximation Algorithm -- 5.2 A Slightly Improved Approximation Algorithm -- 6 Conclusions -- References -- Community-Based Rumor Blocking Maximization in Social Networks -- 1 Introduction -- 2 Related Work -- 3 Network Model and Problem Formulation -- 3.1 The Network Model -- 3.2 Problem Formulation -- 4 Solution for CRBMP in Two Stages -- 4.1 Allocation Problem -- 4.2 Protector Seed Selection (PSS) Problem -- 5 Experimental Results -- 5.1 Experimental Setup -- 5.2 Experimental Results -- 6 Conclusion -- References
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2020
• Extent: 1 online resource
• Subjects: 005.1; Computer algorithms -- Congresses; Management science -- Data processing -- Congresses; Electronic books; Electronic books
• Languages: English
• ISBNs: 9783030576028; 3030576027
• Related ISBNs: 3030576019; 9783030576011
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.