Combinatorial Optimization and Applications
Home > Computing and Information Technology > Computer programming / software engineering > Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)
Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)

Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)

|
     0     
5
4
3
2
1




Available


About the Book

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

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.


Best Sellers


Product Details
  • ISBN-13: 9783540850960
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 480
  • Returnable: Y
  • Series Title: 5165 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 3540850961
  • Publisher Date: 04 Aug 2008
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings(Theoretical Computer Science and General Issues)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!