Improved upper bounds for random-edge and random-jump on abstract cubes

Thomas Dueholm Hansen, Mike Paterson, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Upper bounds are given for the complexity of two very natural randomized algorithms for finding the sink of an Acyclic Unique Sink Orientation (AUSO) of the n-cube. For Random-Edge, we obtain an upper bound of about 1.80n, improving upon the the previous upper bound of about 2n/n logn obtained by Gartner and Kaibel. For Random- Jump, we obtain an upper bound of about (3/2)n, improving upon the previous upper bound of about 1.72n obtained by Mansour and Singh. AUSOs provide an appealing combinatorial abstraction of linear programming and other computational problems such as finding optimal strategies for turn-based Stochastic Games.

Original languageEnglish
Title of host publicationProceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
PublisherAssociation for Computing Machinery
Pages874-881
Number of pages8
ISBN (Print)9781611973389
DOIs
StatePublished - 2014
Event25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 - Portland, OR, United States
Duration: 5 Jan 20147 Jan 2014

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
Country/TerritoryUnited States
CityPortland, OR
Period5/01/147/01/14

Funding

FundersFunder number
Bloom's Syndrome Foundation2012338
Engineering and Physical Sciences Research Council
Engineering and Physical Sciences Research CouncilEP/D063191/1

    Fingerprint

    Dive into the research topics of 'Improved upper bounds for random-edge and random-jump on abstract cubes'. Together they form a unique fingerprint.

    Cite this