Pages that link to "Item:Q3595371"
From MaRDI portal
The following pages link to Approximation Algorithms for Graph Homomorphism Problems (Q3595371):
Displaying 14 items.
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
