3pxbBWQoawBdRDmfc1AkiVPXnxHb2x1S5MZQtXogXGBVeqh9PcjR56adlKak

Paper Publications

Home >> Scientific Research >> Paper Publications

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems(CCF-B)

Release Time:2019-10-25| Hits:

Institution:软件学院

Title of Paper:Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems(CCF-B)

Journal:Algorithmica

First Author:张鹏

All the Authors:Peng Zhang

Document Code:9B5C0ED96EB342D983BE3B2635151F4D

Volume:80

Issue:5

Page Number:1412

Number of Words:8

Translation or Not:No

Date of Publication:2018-05

Release Time:2019-10-25

Prev One:
Scheduling Mobile Collaborating Workforce for Multiple Urgent Events
Next One:
Approximation and hardness results for the max k-uncut problem(CCF-B)

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