Pages that link to "Item:Q3196381"

The following pages link to Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381):

Displaying 8 items.

• Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
• Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
• Graph classes and approximability of the happy set problem (Q2019476) (← links)
• Parameterized complexity of happy coloring problems (Q2192381) (← links)
• Approximation algorithms for vertex happiness (Q2326078) (← links)
• Complexity and approximability of the happy set problem (Q2662689) (← 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)