Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3.
Mingyu XiaoHiroshi NagamochiPublished in: IEICE Trans. Inf. Syst. (2013)
Keyphrases
- exact algorithms
- dominating set
- connected dominating set
- approximation algorithms
- facility location problem
- undirected graph
- knapsack problem
- weighted graph
- np hard
- vehicle routing problem with time windows
- special case
- exact solution
- combinatorial problems
- combinatorial optimization
- benders decomposition
- worst case
- combinatorial optimization problems
- heuristic methods
- facility location
- max sat
- genetic algorithm
- integer programming
- reinforcement learning