on the complexity and approximation of the min-sum and min-max disjoint     paths problems

ISCAS OpenIR

	on the complexity and approximation of the min-sum and min-max disjoint paths problems
	Zhang Peng; Zhao Wenbo
	2007
会议名称	1st International Conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	70-81
会议日期	APR 07-09,
会议地点	Hangzhou, PEOPLES R CHINA
收录类别	ei,istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES
ISSN	0302-9743
ISBN	978-3-540-74449-8
部门归属	Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
关键词	Approximation Theory Graph Theory Optimization Problem Solving
主办者	Zhejiang Univ, Dept Math, Natl Nat Sci Fdn China
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/11104
专题	中国科学院软件研究所
推荐引用方式 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.