Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems.
Kristóf BércziTamás KirályYutaro YamaguchiYu YokoiPublished in: CoRR (2021)
Keyphrases
- similar problems
- benchmark problems
- approximation schemes
- practical solutions
- optimal or near optimal
- combinatorial optimization
- combinatorial problems
- partial solutions
- combinatorial optimisation
- greedy algorithms
- approximate solutions
- greedy algorithm
- neural network
- theoretical guarantees
- specific problems
- error bounds
- decision problems
- matching algorithm
- pattern matching
- genetic algorithm