Elsevier

Information Processing Letters

Volume 67, Issue 5, 15 September 1998, Pages 267-271
Information Processing Letters

Improved approximation algorithms for embedding hyperedges in a cycle

https://doi.org/10.1016/S0020-0190(98)00117-3Get rights and content

Abstract

Approximation algorithms for embedding hyperedges in a cycle so as to minimize the maximum congestion are presented. Our algorithms generate an embedding by transforming the problem into another problem solvable in polynomial time. One algorithm transforms it to a linear programming problem, and the other one to the problem of embedding edges in a cycle. Both algorithms generate an embedding with congestion at most twice of that in an optimal solution. Our problem has applications in CAD and parallel computation.

References (11)

There are more references available in the full text version of this article.

Cited by (19)

  • On packing and coloring hyperedges in a cycle

    2007, Discrete Applied Mathematics
  • The directed ring loading with penalty cost

    2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • 2-Approximation algorithms for weighted hypergraph embedding in a cycle rings

    2012, Proceedings of the 2012 4th International Symposium on Information Science and Engineering, ISISE 2012
View all citing articles on Scopus
View full text