Login / Signup

A fast approximation algorithm for the maximum 2-packing set problem on planar graphs.

Joel Antonio Trejo-SánchezFrancisco A. Madera-RamírezJosé Alberto Fernández-ZepedaJosé Luis López-MartínezAlejandro Flores-Lamas
Published in: Optim. Lett. (2023)
Keyphrases
  • dynamic programming
  • packing problem
  • computational complexity
  • k means
  • planar graphs
  • closed form
  • objective function
  • np hard
  • em algorithm
  • optimal solution
  • worst case
  • linear programming
  • convex hull
  • convex sets