Sign in

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: SWAT (2012)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • vertex cover
  • identical machines
  • bin packing
  • integer programming
  • data structure
  • lower bound