olKUDT4lUAWUgZU6EZG8Ord3Qa8QgBCTVRhoBaNKgkP3thMXD1TWWByDxFMT

Paper Publications

Home >> Scientific Research >> Paper Publications

The label cut problem with respect to path length and label frequency（CCF-B）

Release Time:2019-10-24| Hits:

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

Title of Paper:The label cut problem with respect to path length and label frequency（CCF-B）

Journal:Theoretical Computer Science

First Author:张鹏

All the Authors:Peng Zhang

Document Code:lw-183400

Volume:648

Issue:1

Page Number:72

Number of Words:10

Translation or Not:No

Date of Publication:2016-10

Release Time:2019-10-24

Prev One:
Approximation and hardness results for the max k-uncut problem
Next One:
Improved approximation algorithms for the maximum happy vertices and edges problems

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