approximating minimum label s-t cut via linear programming

ISCAS OpenIR

	approximating minimum label s-t cut via linear programming
	Tang Linqing; Zhang Peng
	2012
会议名称	10th Latin American Symposiumon Theoretical Informatics, LATIN 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	655-666
会议日期	April 16, 2012 - April 20, 2012
会议地点	Arequipa, Peru
收录类别	EI
ISSN	0302-9743
ISBN	9783642293436
部门归属	(1) State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences P.O. Box 8718 Beijing 100190 China; (2) Graduate University Chinese Academy of Sciences Beijing China; (3) School of Computer Science and Technology Shandong University Jinan 250101 China
关键词	Approximation Algorithms Distributed Computer Systems Information Science
主办者	Yahoo! Research; Microsoft Research
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15699
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Tang Linqing,Zhang Peng. approximating minimum label s-t cut via linear programming[C],2012:655-666.