Improved approximation algorithms for embedding hyperedges in a cycle
References (11)
- et al.
Algorithms for routing around a rectangle
Discrete Appl. Math.
(1992) - et al.
A bottom-up layout technique based on two-rectangle routing
Integration: VLSI J.
(1987) - et al.
An Algorithm for the optimal placement and routing of a circuit within a ring of PADS
- et al.
Minimum-congestion hypergraph embedding in a cycle
IEEE Trans. Comput.
(1997) - et al.
A provably good moat routing algorithm
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 MathematicsA polynomial time approximation scheme for embedding a directed hypergraph on a ring
2006, Information Processing LettersOn minimizing the maximum congestion for weighted hypergraph embedding in a cycle
2003, Information Processing LettersThe directed ring loading with penalty cost
2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
2012, Journal of Combinatorial Optimization2-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
Copyright © 1998 Published by Elsevier B.V.