QUzc4WGrSuEsOu2GmJwkim8Ft0RXtJByGhZub1JzDWwWMcKcKaGDrCZzteqD

Paper Publications

Home >> Scientific Research >> Paper Publications

An approximation algorithm for the generalized k-multicut problem（CCF-C）

Release Time:2019-10-24| Hits:

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

Title of Paper:An approximation algorithm for the generalized k-multicut problem（CCF-C）

Journal:Discrete Applied Mathematics

First Author:张鹏

All the Authors:朱大铭,栾峻峰,Peng Zhang

Document Code:lw-141986

Volume:160

Issue:7-8

Page Number:1240

Number of Words:10

Translation or Not:No

Date of Publication:2012-05

Release Time:2019-10-24

Prev One:
On the generalized multiway cut in trees problem
Next One:
Efficient algorithms for the label cut problem

中文    |   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: --