Blind, Greedy, and Random: Ordinal Approximation Algorithms for Graph Problems.

Elliot Anshelevich Shreyas Sekar

Published in: CoRR (2015)

Keyphrases

approximation algorithms
vertex cover
approximation schemes
randomized algorithms
exact algorithms
np hardness
network design problem
undirected graph
special case
minimum cost
worst case
constant factor
np hard
shortest path
random walk
np complete
optimization problems
greedy algorithms
scheduling problem