Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
Julien BasteMaximilian FürstDieter RautenbachPublished in: COCOON (2020)
Keyphrases
- search strategies
- search algorithm
- search strategy
- np hard
- heuristic search
- greedy algorithm
- search methods
- constraint programming
- search problems
- search space
- branch and bound
- retrieval effectiveness
- np complete
- evolutionary algorithm
- meeting scheduling
- test collection
- data structure
- web search
- dynamic programming
- lower bound
- selection strategies
- search procedures