Jumping Doesn’t Help in Abstract Cubes

DOI10.1007/11496915_17zbMath1119.90367OpenAlexW1598325870MaRDI QIDQ3596361

Ingo Schurr, Tibor Szabó

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_17

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations ⋮ A Simple P-Matrix Linear Complementarity Problem for Discounted Games ⋮ Unique end of potential line ⋮ Unique sink orientations of grids ⋮ Violator spaces: Structure and algorithms ⋮ Unnamed Item ⋮ Random edge can be exponential on abstract cubes ⋮ Unnamed Item ⋮ The complexity of optimization on grids

This page was built for publication: Jumping Doesn’t Help in Abstract Cubes