Home > Computing and Information Technology > Computer programming / software engineering > Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings(Theoretical Computer Science and General Issues)
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings(Theoretical Computer Science and General Issues)

Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings(Theoretical Computer Science and General Issues)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Add to Wishlist
X

About the Book

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

Table of Contents:
Algorithms 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.


Best Sellers


Product Details
  • ISBN-13: 9783642020254
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: 2009 ed.
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings
  • Width: 155 mm
  • ISBN-10: 3642020259
  • Publisher Date: 25 May 2009
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 542
  • Series Title: 5573 Lecture Notes in Computer Science
  • Spine Width: 33 mm
  • Weight: 838 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, 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: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, 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!
    ASK VIDYA