Institutional Repository
| on the complexity and approximation of the min-sum and min-max disjoint paths problems | |
| Zhang Peng; Zhao Wenbo | |
| 2007 | |
| Conference Name | 1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 70-81 |
| Conference Date | APR 07-09, |
| Conference Place | Hangzhou, PEOPLES R CHINA |
| Indexed Type | ei,istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES |
| 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. |
| Keyword | Approximation Theory Graph Theory Optimization Problem Solving |
| Sponsorship | Zhejiang Univ, Dept Math, Natl Nat Sci Fdn China |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11104 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang Peng,Zhao Wenbo. on the complexity and approximation of the min-sum and min-max disjoint paths problems[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES,2007:70-81. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| on the complexity an（482KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment