| 题名: | a ptas for embedding hypergraph in a cycle - (extended abstract) |
| 作者: | Deng XT
; Li GJ
|
| 会议名称: | 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)
|
| 会议日期: | JUL 12-16,
|
| 出版日期: | 2004
|
| 会议地点: | Turku, FINLAND
|
| 关键词: | minimum congestion embedding hypergraph in a cycle
; computer application
; polynomial-time approximation scheme
|
| 出版者: | AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS
|
| 出版地: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 收录类别: | sci
; istp
|
| ISSN: | 0302-9743
|
| ISBN: | 3-540-22849-7
|
| 部门归属: | 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.
|
| 主办者: | 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
|
| 英文摘要: | 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 |
| 语种: | 英语
|
| Citation statistics: |
|
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/13006
|
| Appears in Collections: | 软件所图书馆_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| a ptas for embedding hypergraph in a cycle .pdf（186KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Deng XT,Li GJ. a ptas for embedding hypergraph in a cycle - (extended abstract)[C]. 见:31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Turku, FINLAND. JUL 12-16,.
|
|
|
