Skip to main content
Journal Article

A PTAS for embedding hypergraph in a cycle (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3142 433-444
DOI: 10.1007/978-3-540-27836-8_38
10Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Author supplied keywords

Cite

CITATION STYLE

APA

Deng, X., & Li, G. (2004). A PTAS for embedding hypergraph in a cycle (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3142, 433–444. https://doi.org/10.1007/978-3-540-27836-8_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free