The b-Matching Problem in Hypergraphs: Hardness and Approximability.
Mourad El OualiGerold JägerPublished in: COCOA (2012)
Keyphrases
- matching algorithm
- matching process
- approximation algorithms
- graph matching
- graph theory
- np hard
- databases
- ontology matching
- phase transition
- information theoretic
- website
- learning algorithm
- decision trees
- web services
- integrity constraints
- template matching
- information systems
- learning theory
- shape matching
- information retrieval
- neural network
- data sets
- approximate matching