34,162 research outputs found
Thesaurus-based index term extraction for agricultural documents
This paper describes a new algorithm for automatically extracting index terms from documents relating to the domain of agriculture. The domain-specific Agrovoc thesaurus developed by the FAO is used both as a controlled vocabulary and as a knowledge base for semantic matching. The automatically assigned terms are evaluated against a manually indexed 200-item sample of the FAO’s document repository, and the performance of the new algorithm is compared with a state-of-the-art system for keyphrase extraction
On the Configuration LP for Maximum Budgeted Allocation
We study the Maximum Budgeted Allocation problem, i.e., the problem of
selling a set of indivisible goods to players, each with a separate
budget, such that we maximize the collected revenue. Since the natural
assignment LP is known to have an integrality gap of , which
matches the best known approximation algorithms, our main focus is to improve
our understanding of the stronger configuration LP relaxation. In this
direction, we prove that the integrality gap of the configuration LP is
strictly better than , and provide corresponding polynomial time
roundings, in the following restrictions of the problem: (i) the Restricted
Budgeted Allocation problem, in which all the players have the same budget and
every item has the same value for any player it can be sold to, and (ii) the
graph MBA problem, in which an item can be assigned to at most 2 players.
Finally, we improve the best known upper bound on the integrality gap for the
general case from to and also prove
hardness of approximation results for both cases.Comment: 29 pages, 4 figures. To appear in the 17th Conference on Integer
Programming and Combinatorial Optimization (IPCO), 201
- …