Approximation Algorithms for Graph Homomorphism Problems
From MaRDI portal
Recommendations
- Approximability Distance in the Space of H-Colourability Problems
- Approximation and hardness results for the max \(k\)-uncut problem
- Approximation and hardness results for the max \(k\)-uncut problem
- scientific article; zbMATH DE number 1775387
- Improved approximation algorithms for the maximum happy vertices and edges problems
Cited in
(18)- Approximation and hardness results for the max \(k\)-uncut problem
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Parameterized complexity of happy coloring problems
- Approximation algorithms for vertex happiness
- New algorithms for a simple measure of network partitioning
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Approximation and hardness results for the max \(k\)-uncut problem
- Optimal allocation in combinatorial auctions with quadratic utility functions
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Approximability Distance in the Space of H-Colourability Problems
- scientific article; zbMATH DE number 1996252 (Why is no real title available?)
- Approximation Algorithms for CSPs
- Minimum violation vertex maps and their applications to cut problems
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph
- Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph
- New algorithms for a simple measure of network partitioning
- New plain-exponential time classes for graph homomorphism
- Pliability and approximating Max-CSPs
This page was built for publication: Approximation Algorithms for Graph Homomorphism Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595371)
