000 05966nam a22006495i 4500
001 978-3-540-85097-7
003 DE-He213
005 20240730173401.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540850977
_9978-3-540-85097-7
024 7 _a10.1007/978-3-540-85097-7
_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] :
_bSecond International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings /
_cedited by Boting Yang, Ding-Zhu Du, Cao An Wang.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXII, 480 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 ;
_v5165
505 0 _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 CapacitatedMulticast 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.
520 _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.
650 0 _aComputer programming.
_94169
650 0 _aComputer networks .
_931572
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 1 4 _aProgramming Techniques.
_9108139
650 2 4 _aComputer Communication Networks.
_9108140
650 2 4 _aTheory of Computation.
_9108141
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
700 1 _aYang, Boting.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108142
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108143
700 1 _aWang, Cao An.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108144
710 2 _aSpringerLink (Online service)
_9108145
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540850960
776 0 8 _iPrinted edition:
_z9783540873204
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5165
_9108146
856 4 0 _uhttps://doi.org/10.1007/978-3-540-85097-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88900
_d88900