Skip to main content
SpringerLink
Log in

A PTAS for Embedding Hypergraph in a Cycle

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3142))

Included in the following conference series:

Abstract

We consider the problem of embedding hyperedges of a hypergraph as paths in a cycle such that the maximum congestion–the maximum number of paths that use any single edge in a cycle–is minimized. We settle the problem with a polynomial-time approximation scheme.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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. Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic Design of Drugs Without Side-Effects. SIAM J. Comput. 32(4), 1073–1090 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Deng, X., Li, G., Wang, L.: Center and Distinguisher for Strings with Unbounded Alphabet. Journal of Combinatorial Optimization 6, 383–400 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Frank, A.: Edge-disjoint paths in planar graphs. J. Combin. Theory Ser. B 38, 164–178 (1985)

    Article  Google Scholar 

  4. 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 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Gu, Q.P., Wang, Y.: Efficient algorithm for embedding hypergraph in a cycle. In: Proceedings of the 10th International Conference On High Performance Computing, Hyderabad, India, December 2003, pp. 85–94 (2003)

    Google Scholar 

  8. Khanna, S.: A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J. 2, 36–41 (1997)

    Article  Google Scholar 

  9. 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 

  10. Li, M., Ma, B., Wang, L.: On the closest string and substring problems. JACM 49(2), 157–171 (2002)

    Article  MathSciNet  Google Scholar 

  11. Motwani, R., Raghavan, P.: Randomized algorithms. mbridge Univ. Press, Cambridge

    Google Scholar 

  12. Okamura, H., Seymour, P.D.: Multicommodity Flows in Planar Graph. Journal of Combinatorial Theory, Series B 31, 75–81 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Schrijver, A., Seymour, P., Winkler, P.: The Ring Loading Problem. SIAM Discrete Mathematics 11(1), 1–14 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Schrijver, A., Seymour, P., Winkler, P.: The Ring Loading Problem. SIAM Review 41(4), 777–791 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. City University of Hong Kong, Hong Kong SAR, P. R. China

    Xiaotie Deng

  2. Institute of Software, Chinese academy of Sciences, Beijing, 100080, P. R. China

    Guojun Li

  3. School of Mathematics and System Sciences, Shandong University, Jinan, 250100, P. R. China

    Guojun Li

Authors
  1. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guojun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, X., Li, G. (2004). A PTAS for Embedding Hypergraph in a Cycle. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation