Results 1 
3 of
3
MATCHING, EULER TOURS AND THE CHINESE POSTMAN
 MATHEMATICAL PROGRAMMING 5 (1973) 88124. NORTHHOLLAND PUBLISHING COMPANY
, 1973
"... The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more general bm ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more general bmatching blossom algorithm. Algorithms for finding Euler tours and related problems are also discussed.
Entry Pairing in Inverted File
"... Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a fulltext IR system. The idea is to merge the entries of two frequently cooccurring terms, either in the collection or in the answered queries, to form a single, paired, entry. Since postings ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a fulltext IR system. The idea is to merge the entries of two frequently cooccurring terms, either in the collection or in the answered queries, to form a single, paired, entry. Since postings common to paired terms are not replicated, the resulting index is more compact. In addition, queries containing terms that have been paired are answered faster since we can exploit the precomputed posting intersection. In order to choose which terms have to be paired, we formulate the term pairing problem as a MaximumWeight Matching Graph problem, and we evaluate in our scenario efficiency and efficacy of both an exact and a heuristic solution. We apply our technique: (i) to compact a compressed inverted file built on an actual Web collection of documents, and (ii) to increase capacity of an inmemory posting list. Experiments showed that in the first case our approach can improve the compression ratio of up to 7.7%, while we measured a saving from 12% up to 18 % in the size of the posting cache. 1