Pages that link to "Item:Q1750352"
From MaRDI portal
The following pages link to Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352):
Displayed 12 items.
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- New algorithms for a simple measure of network partitioning (Q6111946) (← links)