Login / Signup

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring.

Jianping LiWeidong LiLusheng Wang
Published in: J. Comb. Optim. (2012)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • pairwise
  • special case
  • higher order
  • identical machines
  • vector space
  • computational complexity
  • bin packing
  • approximation guarantees