| Title: | on the complexity and approximation of the min-sum and min-max disjoint paths problems |
| Author: | Zhang Peng
; Zhao Wenbo
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | 1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
|
| Conference Date: | APR 07-09,
|
| Issued Date: | 2007
|
| Conference Place: | Hangzhou, PEOPLES R CHINA
|
| Keyword: | Approximation theory
; Graph theory
; Optimization
; Problem solving
|
| Publisher: | COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| Indexed Type: | ei,istp
|
| ISSN: | 0302-9743
|
| ISBN: | 978-3-540-74449-8
|
| Department: | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
|
| Sponsorship: | Zhejiang Univ, Dept Math, Natl Nat Sci Fdn China
|
| Language: | 英语
|
| Content Type: | 会议论文
|
| 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,.
|
|
|
