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) |
| 会议日期 | JUL 12-16, |
| 会议地点 | Turku, FINLAND |
| 关键词 | minimum congestion embedding hypergraph in a cycle computer application polynomial-time approximation scheme |
| 页码 | 433-444 |
| 英文摘要 | 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 |
| 收录类别 | SCI ; ISTP |
| 会议主办者 | 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 |
| 会议录出版者 | AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 3-540-22849-7 |
| WOS记录号 | WOS:000223656400038 |
| 源URL | [http://124.16.136.157/handle/311060/13006]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | 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,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。