Overview

Full Product Details

Author:   Boting Yang ,  Ding-Zhu Du ,  Cao An Wang
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2008 ed.
Volume:   5165
Dimensions:   Width: 15.50cm , Height: 2.50cm , Length: 23.50cm
Weight:   0.753kg
ISBN:  

9783540850960

ISBN 10:   3540850961
Pages:   480
Publication Date:   04 August 2008
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock  
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

Going 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions