Tackling the maximum happy vertices problem in large networks
type: Item
instance of: scholarly article
title: Tackling the maximum happy vertices problem in large networks
zbMATH Open document ID: 1462.68148
author: Dhananjay Thiruvady
author: Rhyd Lewis
author: Kerri Morgan
published in: 4OR
publication date: 2021-05-20T00:00:00Z
full work available at URL: MHVTabu.pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7350173
zbMATH Keywords: tabu search
zbMATH Keywords: graph colouring
zbMATH Keywords: maximum happy vertices problem
describes a project that uses: Tabu search
describes a project that uses: gCol
MaRDI profile type: Publication
OpenAlex ID: W3007553927
cites work: On the parameterized complexity of happy vertex coloring
cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
cites work: Q3452868
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: Q2779804
cites work: Cluster Analysis
cites work: Q4354785
cites work: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
cites work: Finding happiness: an analysis of the maximum happy vertices problem
cites work: Algorithmic aspects of homophyly of networks
cites work: On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: Improved approximation algorithms for the maximum happy vertices and edges problems
cites work: Graph colouring approaches for a satellite range scheduling problem
DOI: 10.1007/S10288-020-00431-4
Recommended article: Finding happiness: an analysis of the maximum happy vertices problem
Recommended article: A simple and effective algorithm for the maximum happy vertices problem
Recommended article: Improved approximation algorithms for the maximum happy vertices and edges problems
Recommended article: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
Recommended article: Approximation algorithms for vertex happiness
Recommended article: Maximizing happiness in graphs of bounded clique-width
Recommended article: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
Recommended article: Q4945528
Recommended article: Kernelization for maximum happy vertices problem
Recommended article: The maximum happy induced subgraph problem: bounds and algorithms
description: scientific article; zbMATH DE number 7350173