LEADER 06257nam 22008775 450 001 9910484381903321 005 20230406005352.0 010 $a3-540-85097-X 024 7 $a10.1007/978-3-540-85097-7 035 $a(CKB)1000000000490387 035 $a(SSID)ssj0000355458 035 $a(PQKBManifestationID)11277611 035 $a(PQKBTitleCode)TC0000355458 035 $a(PQKBWorkID)10340693 035 $a(PQKB)11632098 035 $a(DE-He213)978-3-540-85097-7 035 $a(MiAaPQ)EBC3063268 035 $a(MiAaPQ)EBC6511613 035 $a(Au-PeEL)EBL6511613 035 $a(OCoLC)759004621 035 $a(PPN)12812587X 035 $a(EXLCZ)991000000000490387 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Optimization and Applications$b[electronic resource] $eSecond International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings /$fedited by Boting Yang, Ding-Zhu Du, Cao An Wang 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XII, 480 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5165 300 $aIncludes index. 311 $a3-540-85096-1 320 $aIncludes bibliographical references and index. 327 $aGoing Weighted: Parameterized Algorithms for Cluster Editing -- Parameterized Graph Editing with Chosen Vertex Degrees -- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries -- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets -- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems -- A Parameterized Perspective on Packing Paths of Length Two -- New Algorithms for k-Center and Extensions -- Separating Sublinear Time Computations by Approximate Diameter -- Computational Study on Dominating Set Problem of Planar Graphs -- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region -- Parameterized Algorithms for Generalized Domination -- Turán Graphs, Stability Number, and Fibonacci Index -- Vertex-Uncertainty in Graph-Problems -- Protean Graphs with a Variety of Ranking Schemes -- Simplicial Powers of Graphs -- On k- Versus (k?+?1)-Leaf Powers -- Flows with Unit Path Capacities and Related Packing and Covering Problems -- Strong Formulations for 2-Node-Connected Steiner Network Problems -- Algorithms and Implementation for Interconnection Graph Problem -- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order -- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks -- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks -- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems -- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph -- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem -- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs -- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem -- Covering Arrays Avoiding Forbidden Edges -- The Robot Cleans Up -- On Recovering Syntenic Blocks from Comparative Maps -- Automatic Generation of Symmetry-Breaking Constraints -- On the Stable Set Polytope of Claw-Free Graphs -- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs -- Magic Labelings on Cycles and Wheels -- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs -- The Clique Corona Operation and Greedoids -- On the Surface Area of the (n, k)-Star Graph -- Enumerating Isolated Cliques in Synthetic and Financial Networks -- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem -- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays -- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization -- Stochastic Online Scheduling Revisited -- Delay Management Problem: Complexity Results and Robust Algorithms -- Clustered SplitsNetworks. 330 $aThis book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5165 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 676 $a519.6 702 $aYang$b Boting 702 $aDu$b Dingzhu 702 $aWang$b Cao An 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484381903321 996 $aCombinatorial Optimization and Applications$9772251 997 $aUNINA