We see that javascript is disabled or not supported by your browser - javascript is needed for important actions on the site. Read more

What's New - Home - Login

Member $avings: $82,154,039.24 | Books Available: 670,662 | Members Online: 163

Swap Used Books - Buy New Books at Great Prices!

How To Swap Books Sign Up Search submenu

PBS Market (New Books)

Gift Buying Guide

Book Browser Advanced Search Books Posted Today Member Book Reviews Award Winning Books NYT Best Sellers Amazon Best Sellers Most Traveled Copies Club Wish List

Discussion Forums Book Lists

Club Lists My Book Lists My Watched Lists Create a List

Blog Donations

School Donation Program In Memory of... Military Donation Program Friends of PBS

Box-O-Books Maps The Eclectic Pen Fun Stuff

20 Questions Sudoku Bookmark Creator

Top 100

Requests Posts Swappers Referrers Reviewers

Pulse of PBS Spread The Word

Invite Friends Bookmarks Facebook Page Facebook App More Ways...

Photo Gallery Recipes Club Tag Cloud Member Testimonials

Help Center submenu

How To Swap Books Browse Help Docs Ask the Librarian PBS Member Icons Live Help

Kiosk

PBS Market (New Books) Go Shopping Buy Credits Buy PBS Money Upgrade Membership Gift Certificates Transfer Credits

Need Help?

Search - Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science)

Hamiltonian Cycle Problem and Markov Chains - International Series in Operations Research & Management Science
Author: Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar, Giang T. Nguyen

This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stem... more »s precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies. The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances. Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.

ISBN-13: 9781461432319
ISBN-10: 1461432316
Publication Date: 4/24/2012
Pages: 215
Edition: 2012
Rating:

0 stars, based on 0 rating

Publisher: Springer
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review

Genres:

Back to the Top ↑

Search - Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science)

Loading...