Abstract
Ejov et al. [34] embed the Hamiltonian cycle problem in a limiting average Markov decision process model with an asymmetric linear perturbation defined in (3.14). The authors prove that for positive and sufficiently small values of ε, determining the Hamiltonicity of a given graph is equivalent to minimising the top-left element of the fundamental matrix G of an MDP associated with the given graph, over the space of feasible deterministic policies F D . The conjecture that the same holds for the larger space F S remains open.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Borkar, V.S., Ejov, V., Filar, J.A., Nguyen, G.T. (2012). Determinants. In: Hamiltonian Cycle Problem and Markov Chains. International Series in Operations Research & Management Science, vol 171. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3232-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3232-6_5
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3231-9
Online ISBN: 978-1-4614-3232-6
eBook Packages: Business and EconomicsBusiness and Management (R0)