A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle.
Chaoxia YangGuojun LiPublished in: FAW (2010)
Keyphrases
- polynomial time approximation
- np hard
- approximation algorithms
- error bounds
- worst case
- optimal solution
- hypergraph partitioning
- lower bound
- higher order
- constraint satisfaction problems
- identical machines
- bin packing
- scheduling problem
- special case
- pairwise
- linear program
- vector space
- linear programming
- voting scheme
- information hiding
- data structure