|
|
|
|
| 题名: | on the complexity and approximation of the min-sum and min-max disjoint paths problems |
| 作者: | Zhang Peng
; Zhao Wenbo
|
| 会议文集: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| 会议名称: | 1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
|
| 会议日期: | APR 07-09,
|
| 出版日期: | 2007
|
| 会议地点: | Hangzhou, PEOPLES R CHINA
|
| 关键词: | Approximation theory
; Graph theory
; Optimization
; Problem solving
|
| 出版者: | COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES
|
| 出版地: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 收录类别: | ei,istp
|
| ISSN: | 0302-9743
|
| ISBN: | 978-3-540-74449-8
|
| 部门归属: | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
|
| 主办者: | Zhejiang Univ, Dept Math, Natl Nat Sci Fdn China
|
| 语种: | 英语
|
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/11104
|
| Appears in Collections: | 软件所图书馆_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| on the complexity and approximation of the min-sum and min-max disjoint paths problems.pdf（482KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Zhang Peng,Zhao Wenbo. on the complexity and approximation of the min-sum and min-max disjoint paths problems[C]. 见:1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Hangzhou, PEOPLES R CHINA. APR 07-09,.
|
|
|
|
|
|
Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated. |
|
