Phase Transitions in Combinatorial Optimization Problems
Home > Mathematics and Science Textbooks > Physics > Mathematical physics > Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics
Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.

Table of Contents:
Algorithms Introduction to Graphs Introduction to Complexity Theory Statistical Mechanics of the Ising Model Algorithms and Numerical Results for Vertex Covers Statistical Mechanics of Vertex-covers on a Random Graph The Dynamics of Vertex-cover Algorithms Towards new, Statistical-mechanics Motivated Algorithms The Satisfiability Problem Optimization Problems in Physics

About the Author :
Alexander K. Hartmann, Ph.D. (1998) from the University of Heidelberg, Diplom (1993) from the University of Duisburg. Since January 2003, Head of the Junior Research group "Complex Ground States of Disordered Systems at the University of Göttingen funded by the Volkswagen Stiftung. 1998-2003, Research Assistant in Prof. Annette Zippelius' group at the University of Göttingen. 2001, Visiting Scientist at the University of California, Santa Cruz and the Ecole Normale Superieure. His research interests are the computer simulations of spin glasses, random field systems and diluted antiferromagnets, gas atoms inside polymer systems, combinatorial optimization problems, random surfaces and surface sputtering, and biophysics (RNA secondary structures and sequence alignment). Martin Weigt, born 1970 in Berlin, Germany; Ph.D. (1998) from Otto-von-Guericke University, Magdeburg, Diplom (1993) from Humboldt University Berlin. Since 1999, Research Assistant in Prof. Annette Zippelius' group at the University of Göttingen. In 2000, 2001, and 2002, Visiting Scientist at the International Centre of Theoretical Physics, Trieste, Italy. His research interests are statistical mechanics of disordered systems and application in random combinatorics and theoretical computer science.

Review :
"This new book is a concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics." Metall "A well-balanced, concise yet comprehensive introduction, combining statistical physics and combinatorial optimization." Zeitschrift für Kristallographie


Best Sellers


Product Details
  • ISBN-13: 9783527606863
  • Publisher: John Wiley and Sons Ltd
  • Publisher Imprint: Wiley-VCH Verlag GmbH
  • Language: English
  • Sub Title: Basics, Algorithms and Statistical Mechanics
  • ISBN-10: 3527606866
  • Publisher Date: 12 May 2006
  • Binding: Digital (delivered electronically)
  • No of Pages: 360


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics
John Wiley and Sons Ltd -
Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics
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.

Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!