Login / Signup

A polynomial-time approximation scheme for embedding hypergraph in a cycle.

Guojun LiXiaotie DengYing Xu
Published in: ACM Trans. Algorithms (2009)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • vector space
  • higher order
  • scheduling problem
  • minimum cost
  • lower bound
  • special case
  • bin packing
  • identical machines