Improved approximation algorithms for the maximum happy vertices and edges problems
DOI10.1007/978-3-319-21398-9_13zbMATH Open1386.68225OpenAlexW3023272694MaRDI QIDQ3196381FDOQ3196381
Authors: Peng Zhang, Tao Jiang, Angsheng Li 
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_13
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Networks, crowds and markets. Reasoning about a highly connected world.
- The Complexity of Multiterminal Cuts
- Simplex partitioning via exponential clocks and the multiway cut problem
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- An improved approximation algorithm of MULTIWAY CUT.
- Algorithmic aspects of homophyly of networks
- Approximation Algorithms for Graph Homomorphism Problems
- Multiway cut, pairwise realizable distributions, and descending thresholds
Cited In (17)
- Parameterized algorithms for the happy set problem
- Approximation and hardness results for the max \(k\)-uncut problem
- Graph classes and approximability of the happy set problem
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Approximation Algorithms for Graph Homomorphism Problems
- Finding happiness: an analysis of the maximum happy vertices problem
- Tackling the maximum happy vertices problem in large networks
- The maximum happy induced subgraph problem: bounds and algorithms
- Maximizing happiness in graphs of bounded clique-width
- A simple and effective algorithm for the maximum happy vertices problem
- Kernelization for maximum happy vertices problem
- Approximation algorithms for vertex happiness
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Complexity and approximability of the happy set problem
- Algorithmic aspects of homophyly of networks
- Lower bounds for the happy coloring problems
- Parameterized complexity of happy coloring problems
This page was built for publication: Improved approximation algorithms for the maximum happy vertices and edges problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196381)
