Skip to main content
SpringerLink
Log in

An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3521))

Included in the following conference series:

  • 1123 Accesses

Abstract

We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively studied. It was shown that the undirected version was NP-complete. A polynomial time approximation scheme (PTAS) for the undirected version has been developed. In this paper, we design a polynomial time approximation scheme for the directed version.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, B.S., Pinter, R.Y.: An algorithm for the optimal placement and routing of a circuit within a ring of pads. In: Proc. 24th Symp. Foundations of Computer Science, pp. 360–370 (1983)

    Google Scholar 

  2. Frank, A., Nishizeki, T., Saito, N., Suzuki, H., Tardos, E.: Algorithms for routing around a rectangle. Discrete Applied Mathematics 40, 363–378 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proc. of the 26th Annual ACM Symposium on the Theory of Computing, pp. 134–143 (1994)

    Google Scholar 

  4. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge Univ. Press, Cambridge (1995)

    MATH  Google Scholar 

  5. Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding in a cycle. IEEE Trans. on Computers 46(5), 600–602 (1997)

    Article  MathSciNet  Google Scholar 

  6. Khanna, S.: A polynomial time approximation scheme for the SONET ring loading problem. Bell Labs Tech. J. 2, 36–41 (1997)

    Article  Google Scholar 

  7. Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. Siam Journal on Discrete Mathematics 11(1), 1–14 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wilfong, G., Winkler, P.: Ring routing and wavelength translation. In: Proc. of the ninth annual ACM-SIAM symposium on Discrete Algorithms (SODA 1998), San Francisco, California, pp. 333–341 (1998)

    Google Scholar 

  9. Gonzalez, T.: Improved approximation algorithm for embedding hyperedges in a cycle. Information Processing Letters 67, 267–271 (1998)

    Article  MathSciNet  Google Scholar 

  10. Lee, S.L., Ho, H.J.: Algorithms and complexity for weighted hypergraph embedding in a cycle. In: Proc. of the 1st International Symposium on Cyber World, CW 2002 (2002)

    Google Scholar 

  11. Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J.ACM 49, 157–171 (2002)

    Article  MathSciNet  Google Scholar 

  12. Gu, Q.P., Wang, Y.: Efficient algorithm for embedding hypergraph in a cycle. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol. 2913, pp. 85–94. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Deng, X., Li, G.: A PTAS for Embedding 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Shandong University, Jinan, Shandong Province, P. R. China

    Kang Li

  2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Lusheng Wang

Authors
  1. Kang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, 650 Harry Road, 95120, San Jose, CA,  

    Nimrod Megiddo

  2. The State Key Lab for Manufacturing Systems Engineering, 710049, Xi’an, P.R. China

    Yinfeng Xu

  3. Department of Computer Science, Montana State University, 59717, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, K., Wang, L. (2005). An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_42

Download citation

  • DOI: https://doi.org/10.1007/11496199_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26224-4

  • Online ISBN: 978-3-540-32440-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation