Institutional Repository
| approximating minimum label s-t cut via linear programming | |
| Tang Linqing; Zhang Peng | |
| 2012 | |
| Conference Name | 10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 655-666 |
| Conference Date | April 16, 2012 - April 20, 2012 |
| Conference Place | Arequipa, Peru |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642293436 |
| Department | (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 |
| Keyword | Approximation Algorithms Distributed Computer Systems Information Science |
| Sponsorship | Yahoo! Research; Microsoft Research |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15699 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Tang Linqing,Zhang Peng. approximating minimum label s-t cut via linear programming[C],2012:655-666. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment