38YniiLwnWKd8lf4DxIB8STb7UoQ5x9upYeN95zCp6DfWkg783uRoRdWlJdR

Paper Publications

Home >> Scientific Research >> Paper Publications

A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design

Release Time:2019-10-24| Hits:

Institution:计算机科学与技术学院

Title of Paper:A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design

Journal:Journal of Combinatorial Optimization

First Author:张鹏

All the Authors:Peng Zhang

Document Code:lw-154561

Volume:27

Issue:4

Page Number:663

Number of Words:10

Translation or Not:No

Date of Publication:2014-05

Release Time:2019-10-24

Prev One:
Algorithmic aspects of homophyly of networks（CCF-B）
Next One:
Unbalanced graph cuts with minimum capacity（CCF-C）

中文    |   MOBILE Version   |   Login   |   SDU   

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click: Times

The Open Time: --

The Last Update Time: --