Approximation, Randomization,and Combinatorial Optimization: Algorithms and Techniques: 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16–18, 2017, Berkeley, CA, USA

On the positive side, variants of the greedy approach have been used in order to compute maximum matchings in quasi linear-time on some graph classes that admit a

The discovery of a gene having such a large e ffect on ovulation rate and prolificacy in sheep was totally unsuspected at this time and a number of research teams all over the

Recall that our ILP algorithms are based on three models: a cut/assignment model (CAM), a label model where the representative vertices are vertices of the graph (LMR) and a label

The topics included security and privacy models, pattern-based security and privacy modelling, knowledge base for security, reasoning, argumentation, traceability, and forensics

Optimal constrained matching problem (see [3, 20]), which is a variant from the optimal matching problem and the partial transport problem (see for instance [14, 18]), consists

In this section, we present the results obtained by running InsMT+ on instance matching track of OAEI 2015 evaluation campaign.. 2.1 Author

Besides real-world specific match- ing tasks, involving e.g., large biomedical ontologies, OAEI 2016 introduced the process model matching track as well as a desease-phenotype

This work presented an interactive approach for ontology matching, based on manipulation of the set of candidate correspondences with techniques to decrease the number of