An improved lower bound for competitive graph exploration.
Alexander BirxYann DisserAlexander V. HoppChristina KarousatouPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- lower bound
- upper bound
- competitive ratio
- objective function
- random walk
- structured data
- branch and bound algorithm
- np hard
- graph structure
- constant factor
- lower and upper bounds
- optimal solution
- weighted graph
- branch and bound
- directed acyclic graph
- graph model
- undirected graph
- bipartite graph
- graph matching
- spanning tree
- dependency graph
- graph theory
- sample complexity
- graph theoretic
- online algorithms
- linear programming
- data structure
- graph based algorithm
- polynomial approximation