Login / Signup

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs.

Daniel AntunesClaire MathieuNabil H. Mustafa
Published in: ESA (2017)
Keyphrases
  • planar graphs
  • optimal solution
  • search algorithm
  • dynamic programming
  • lower bound
  • special case
  • worst case
  • closed form
  • search space
  • probability distribution
  • combinatorial optimization
  • knapsack problem
  • minimum weight