Institutional Repository
| a ptas for embedding hypergraph in a cycle - (extended abstract) | |
| Deng XT; Li GJ | |
| 2004 | |
| Conference Name | 31st International Colloquium on Automata, Languages and Programming (ICALP 2004) |
| Pages | 433-444 |
| Conference Date | JUL 12-16, |
| Conference Place | Turku, FINLAND |
| Indexed Type | sci ; istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 3-540-22849-7 |
| Department | City Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. |
| English 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 app |
| Keyword | MInimum Congestion EmbeddIng Hypergraph In a Cycle Computer Application Polynomial-time Approximation Scheme |
| Sponsorship | Turku Ctr Comp Sci, Acad Finland, City Turku, Finnair, Finnish Acad Sci & Letters, Vaisala Fdn, Math Fdn, Finnish Cultural Fdn, Fujitsu Siemens, IBM, MasterPlanet, Nokia, Nordea, Sampo Life Insurance Co Ltd, Stiftelsen Abo Akad, Turku Univ Fdn |
| Language | 英语 |
| WOS ID | WOS:000223656400038 |
| Citation statistics | |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/13006 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Deng XT,Li GJ. a ptas for embedding hypergraph in a cycle - (extended abstract)[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS,2004:433-444. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a ptas for embedding(186KB) | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment