Combinatorial optimization and applications : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings /: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. (2015)
- Record Type:
- Book
- Title:
- Combinatorial optimization and applications : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings /: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. (2015)
- Main Title:
- Combinatorial optimization and applications : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings
- Other Titles:
- COCOA 2015
- Further Information:
- Note: Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du (eds.).
- Editors:
- Lu, Zaixin
Kim, Donghyun
Wu, Weili
Li, Wei (Wayne)
Du, Dingzhu - Other Names:
- COCOA (Conference), 9th
- Contents:
- Intro; Preface; Organization; Contents; Classic Combinatorial Optimization; Improved Algorithms for the Evacuation Route Planning Problem; 1 Introduction; 2 Related Work; 3 Problem Definition and Model; 4 The Single Source Single Sink Problem; 4.1 Limitation of QPER Algorithm for SSEP; 4.2 Modified Algorithm for SSEP When We Are Given k Edge-Disjoint Paths; 4.3 An Important Observation; 4.4 Our Algorithm for SSEP; 4.5 Running Time Analysis of SSEP; 4.6 CCRP Algorithm for SSEP and Some Observations; 4.7 Analysis of Algorithm [1]; 5 Randomized Behavior Model of People 5.1 Lower Bound for Expected Evacuation Time5.2 Algorithm for Randomized Behavior of People; 6 Experimental Results; 6.1 Details of the Experiments; 6.2 Results; 7 Conclusion and Future Work; References; Improved MaxSAT Algorithms for Instances of Degree 3; 1 Introduction; 2 Reduction Rules; 3 An O*(1.194k)-time Parameterized Algorithm; 4 An O*(1.237n)-time Algorithm for (n, 3)-MaxSAT; 5 Conclusion; References; Directed Pathwidth and Palletizers; 1 Introduction; 2 Preliminaries; 3 Main Result; 4 Applications; 4.1 Hardness Result; 4.2 Bounded FIFO Stack-Up Systems; 4.3 Approximation 5 ConclusionReferences; Black and White Bin Packing Revisited; 1 Introduction; 2 Algorithm ``Balance Between Stacks''; 2.1 Description of Algorithm BAL; 3 Competitive Analysis of Algorithm BAL; 3.1 Terminology and Case Analysis; 3.2 A Function Calculating the Total Size of Bins; 3.3 Case by Case Analysis of the Competitive Ratio ofIntro; Preface; Organization; Contents; Classic Combinatorial Optimization; Improved Algorithms for the Evacuation Route Planning Problem; 1 Introduction; 2 Related Work; 3 Problem Definition and Model; 4 The Single Source Single Sink Problem; 4.1 Limitation of QPER Algorithm for SSEP; 4.2 Modified Algorithm for SSEP When We Are Given k Edge-Disjoint Paths; 4.3 An Important Observation; 4.4 Our Algorithm for SSEP; 4.5 Running Time Analysis of SSEP; 4.6 CCRP Algorithm for SSEP and Some Observations; 4.7 Analysis of Algorithm [1]; 5 Randomized Behavior Model of People 5.1 Lower Bound for Expected Evacuation Time5.2 Algorithm for Randomized Behavior of People; 6 Experimental Results; 6.1 Details of the Experiments; 6.2 Results; 7 Conclusion and Future Work; References; Improved MaxSAT Algorithms for Instances of Degree 3; 1 Introduction; 2 Reduction Rules; 3 An O*(1.194k)-time Parameterized Algorithm; 4 An O*(1.237n)-time Algorithm for (n, 3)-MaxSAT; 5 Conclusion; References; Directed Pathwidth and Palletizers; 1 Introduction; 2 Preliminaries; 3 Main Result; 4 Applications; 4.1 Hardness Result; 4.2 Bounded FIFO Stack-Up Systems; 4.3 Approximation 5 ConclusionReferences; Black and White Bin Packing Revisited; 1 Introduction; 2 Algorithm ``Balance Between Stacks''; 2.1 Description of Algorithm BAL; 3 Competitive Analysis of Algorithm BAL; 3.1 Terminology and Case Analysis; 3.2 A Function Calculating the Total Size of Bins; 3.3 Case by Case Analysis of the Competitive Ratio of BAL; 4 Concluding Remarks; References; Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties; 1 Introduction; 2 General Local Search Algorithm; 3 Local Search for k-MPLP; 3.1 Analysis; 4 Local Search for k-FLPLP; 4.1 Analysis 4.2 Improve the Local Gap Using Scaling Technique5 Polynomial-Time Algorithm for k-MPLP and k-FLPLP; References; A (5.83+)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties; 1 Introduction; 2 Local Search Algorithm; 2.1 Operations; 2.2 Polynomial-Time Proof; 2.3 Algorithm; 3 Analysis; 4 Discussions; References; Variants of Multi-resource Scheduling Problems with Equal Processing Times; 1 Introduction; 2 Literature Review, Framework and Notations; 2.1 Related Work; 2.2 Objective Functions; 2.3 Network Flows; 2.4 Scheduling Graph; 3 Variety of Machines 4 General Objective Function5 Monotonic Objective Function; 6 Periodic Objective Function; 6.1 Scheduling Problem as a Network Flow; 6.2 Periodic Objective Function Formulated as a Network Flow; 7 Additional Remark; 8 Conclusion; References; Geometric Optimization; The Discrete and Mixed Minimax 2-Center Problem; 1 Introduction; 2 The Discrete Minimax 2-Center Problem; 3 The Mixed Minimax 2-Center Problem; 3.1 The Structure of the Optimal Solution; 3.2 Solving MMM2CP for a Fixed p and r; 3.3 The Monotone Property; 4 Conclusion; References … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2015
- Extent:
- 1 online resource (xiii, 810 pages), color illustrations
- Subjects:
- 519.6/4
Computer science
Combinatorial optimization -- Congresses
Computer science -- Mathematics -- Congresses
Combinatorial optimization
Computer science -- Mathematics
Computer Science
Engineering & Applied Sciences
Computers -- Data Processing
Computers -- Programming -- Algorithms
Computers -- Hardware -- Network Hardware
Computers -- Computer Graphics
Discrete mathematics
Mathematical theory of computation
Numerical analysis
Network hardware
Graphics programming
Computer software
Computational complexity
Electronic data processing
Algorithms
Computer Communication Networks
Computer graphics
Algorithms & data structures
Electronic books
Conference papers and proceedings
Electronic books - Languages:
- English
- ISBNs:
- 9783319266268
3319266268 - Related ISBNs:
- 9783319266251
331926625X - Notes:
- Note: Online resource; title from PDF title page (SpringerLink, viewed December 21, 2015).
- 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.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.355339
- Ingest File:
- 01_316.xml