| a ptas for embedding hypergraph in a cycle - (extended abstract) |
| Deng XT; Li GJ
|
| 2004
|
| 会议名称 | 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)
|
| 页码 | 433-444
|
| 会议日期 | JUL 12-16,
|
| 会议地点 | Turku, FINLAND
|
| 收录类别 | sci
; istp
|
| 出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 出版者 | AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS
|
| 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.
|
| 摘要 | 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 |
| 关键词 | MInimum Congestion EmbeddIng Hypergraph In a Cycle
Computer Application
Polynomial-time Approximation Scheme
|
| 主办者 | 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
|
| 语种 | 英语
|
| WOS记录号 | WOS:000223656400038
|
| 引用统计 |
|
| 内容类型 | 会议论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/13006
|
| 专题 | 中国科学院软件研究所
|
推荐引用方式
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.
|
修改评论