Cargando…
Combinatorial Optimization and Applications Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings /
This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009. The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original r...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2009.
|
| Edición: | 1st ed. 2009. |
| Colección: | Theoretical Computer Science and General Issues,
5573 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-02026-1 | ||
| 003 | DE-He213 | ||
| 005 | 20230405234356.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2009 gw | s |||| 0|eng d | ||
| 020 | |a 9783642020261 |9 978-3-642-02026-1 | ||
| 024 | 7 | |a 10.1007/978-3-642-02026-1 |2 doi | |
| 050 | 4 | |a QA76.6-76.66 | |
| 072 | 7 | |a UM |2 bicssc | |
| 072 | 7 | |a COM051000 |2 bisacsh | |
| 072 | 7 | |a UM |2 thema | |
| 082 | 0 | 4 | |a 005.11 |2 23 |
| 245 | 1 | 0 | |a Combinatorial Optimization and Applications |h [electronic resource] : |b Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings / |c edited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos. |
| 250 | |a 1st ed. 2009. | ||
| 264 | 1 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2009. | |
| 300 | |a XIII, 542 p. |b online resource. | ||
| 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 |b PDF |2 rda | ||
| 490 | 1 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 5573 | |
| 505 | 0 | |a Algorithms for Network Design -- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision -- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices -- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines -- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs -- Bioinformatics -- DNA Library Screening, Pooling Design and Unitary Spaces -- Improved Algorithms for the Gene Team Problem -- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting -- Combinatorics and Its Applications -- Generalized Russian Cards Problem -- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations -- Matching Techniques Ride to Rescue OLED Displays -- Computational Geometry -- On Open Rectangle-of-Influence Drawings of Planar Graphs -- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems -- Variable-Size Rectangle Covering -- On-Line Multiple-Strip Packing -- Game Theory -- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game -- Improved Bounds for Facility Location Games with Fair Cost Allocation -- Graph Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem -- On Construction of Almost-Ramanujan Graphs -- A 2log2(n)-Approximation Algorithm for Directed Tour Cover -- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation -- Graph Theory -- Hamiltonian Decomposition of Some Interconnection Networks -- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge -- A Note on Edge Choosability and Degeneracy of Planar Graphs -- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices -- On Integrity of Harary Graphs -- A Note on n-Critical Bipartite Graphs and Its Application -- Network Models and Problems -- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem -- Deterministically Estimating Data Stream Frequencies -- Positive Influence Dominating Set in Online Social Networks -- On-line Algorithms -- Optimal Algorithms for the Online Time Series Search Problem -- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information -- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine -- A Note on Online Scheduling for Jobs with Arbitrary Release Times -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem -- On Disjoint Shortest Paths Routing on the Hypercube -- A New Approach for Rearrangeable Multicast Switching Networks -- Scheduling -- Bicriteria Scheduling on Single-Machine with Inventory Operations -- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine -- Scheduling with Rejection to Minimize the Makespan -- Scheduling Problems in Cross Docking -- Makespan Minimization with Machine Availability Constraints -- A Mathematical Programming Approach for Online Hierarchical Scheduling -- Recoverable Robust Timetables on Trees -- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems -- Integrated Production and Delivery Scheduling with Disjoint Windows -- Wireless and Optical Networks -- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks -- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks -- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas -- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings -- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. | |
| 520 | |a This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009. The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting. | ||
| 650 | 0 | |a Computer programming. | |
| 650 | 0 | |a Computer networks . | |
| 650 | 0 | |a Software engineering. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Computer science-Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 1 | 4 | |a Programming Techniques. |
| 650 | 2 | 4 | |a Computer Communication Networks. |
| 650 | 2 | 4 | |a Software Engineering. |
| 650 | 2 | 4 | |a Algorithms. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 700 | 1 | |a Du, Ding-Zhu. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Hu, Xiaodong. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Pardalos, Panos M. |e editor. |0 (orcid)0000-0003-2824-101X |1 https://orcid.org/0000-0003-2824-101X |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642020278 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642020254 |
| 830 | 0 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 5573 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-642-02026-1 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-LNC | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||