Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
- 23 March 2017
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 80 (5) , 1412-1438
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Shandong Province (ZR2016AM28, ZR2015FM008)
- National Natural Science Foundation of China (61672323)
- State Scholarship Fund of China
- the Fundamental Research Funds of Shandong University (2015JC006)
- the hundred talent program of the Chinese Academy
- The National Basic Research Program of China (2014CB340302)
- the NSERC
- the Grants-in-Aid for Scientific Research of Japan (26330017)
This publication has 14 references indexed in Scilit:
- Homophyly/kinship hypothesis: Natural communities, and predicting in networksPhysica A: Statistical Mechanics and its Applications, 2015
- Multiway cut, pairwise realizable distributions, and descending thresholds2014
- Simplex partitioning via exponential clocks and the multiway cut problem2013
- Networks, Crowds, and Markets2010
- Approximation Algorithms for Graph Homomorphism ProblemsLecture Notes in Computer Science, 2006
- Rounding Algorithms for a Geometric Embedding of Minimum Multiway CutMathematics of Operations Research, 2004
- Approximation algorithms for classification problems with pairwise relationshipsJournal of the ACM, 2002
- An Improved Approximation Algorithm for MULTIWAY CUTJournal of Computer and System Sciences, 2000
- Linear Programming in O([n3/ln n]L) OperationsSIAM Journal on Optimization, 1999
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994