Login / Signup

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.

Takehiro ItoShin-Ichi NakanoYoshio OkamotoYota OtachiRyuhei UeharaTakeaki UnoYushi Uno
Published in: Comput. Geom. (2016)
Keyphrases
  • polynomial time approximation
  • np hard
  • error bounds
  • approximation algorithms
  • vertex cover
  • hough transform
  • identical machines
  • special case
  • upper bound
  • dynamic programming
  • bin packing