Login / Signup

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241).

Martin E. DyerUriel FeigeAlan M. FriezeMarek Karpinski
Published in: Dagstuhl Reports (2011)
Keyphrases
  • approximation algorithms
  • randomized algorithms
  • special case
  • worst case
  • np hard
  • upper bound
  • greedy algorithm
  • minimum cost
  • undirected graph
  • set cover