000 06934nam a22006255i 4500
001 978-3-642-02026-1
003 DE-He213
005 20240730204025.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642020261
_9978-3-642-02026-1
024 7 _a10.1007/978-3-642-02026-1
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aCombinatorial Optimization and Applications
_h[electronic resource] :
_bThird International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings /
_cedited by Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIII, 542 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5573
505 0 _aAlgorithms 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 BeingEqual 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 _aThis 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 _aComputer programming.
_94169
650 0 _aComputer networks .
_931572
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aProgramming Techniques.
_9177909
650 2 4 _aComputer Communication Networks.
_9177910
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9177911
700 1 _aHu, Xiaodong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9177912
700 1 _aPardalos, Panos M.
_eeditor.
_0(orcid)
_10000-0003-2824-101X
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9177913
710 2 _aSpringerLink (Online service)
_9177914
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642020254
776 0 8 _iPrinted edition:
_z9783642020278
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5573
_9177915
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02026-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c97682
_d97682