Abstract
For a hypergraph and k different colors, we study the problem of packing and coloring some hyperedges of the hypergraph as paths in a cycle such that the total profit of the chosen hyperedges are maximized, here each link e j on the cycle is used at most c j times, each hyperedge h i has a profit p i and any two paths, each spanning all vertices of its corresponding hyperedge, must receive different colors if they share a link. This new problem arises in optical communication networks and it is called the Maximum Profits of Packing and Coloring Hyperedges in a Cycle problem (MPPCHC).
In this paper, we prove that the MPPCHC problem is NP-hard and present a 2-approximation algorithm. For the special case, where each hyperedge has the same profit and each capacity c j is k, we propose a \(\frac{3}{2}\)-approximation algorithm to handle the problem.
AMS Classifications: 90B10, 94C15.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics 59, 225–235 (1995)
Carpenter, T., Cosares, S., Ganley, J.L., Saniee, I.: A simple approximation algorithm for two problems in circuit design. IEEE Trans. Compt. 47(11), 1310–1312 (1998)
Deng, X.T., Li, G.J.: A PTAS for embeding hypergraph in a cycle (extended abstract). In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 433–444. Springer, Heidelberg (2004)
Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding in a cycle. IEEE Trans. Comput. 46(5), 600–602 (1997)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Gonzalez, T.F.: Improved approximation algorithms for embedding hyperedges in a cycle. Information Processing Letter 67, 267–271 (1998)
Gu, Q., Wang, Y.: Efficient algorithm for embedding hypergraphs in a cycle. In: Proceedings of the 10th International Conference on High Performance Computing, Hyderabad, India (December 2003)
Lee, S.L., Ho, H.J.: On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Information Processing Letter 87, 271–275 (2003)
Li, J.P., Li, K., Wang, L.S., Zhao, H.: Maximizing Profits of Requests in WDM Networks, to appear in Journal of Combinatorial Optimization (2005)
Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing Request Blocking in All- Optical Rings. In: Proceedings of IEEE INFOCOM, pp. 1355–1361 (2003)
Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceeding of the 26th Annual ACM Symposium on the Theory of Computing, pp. 134–143 (1994)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, The Netherlands (2003)
Tarjan, R.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Li, K., Law, K.C.K., Zhao, H. (2005). On Packing and Coloring Hyperedges in a Cycle. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_24
Download citation
DOI: https://doi.org/10.1007/11533719_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)