The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most one such additional outgoing edge to each page of a tree-like site, minimizing the path length, i.e. the expected number of “clicks” necessary for the user to reach his destination page. Another common formulation of that problem...
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial time algorithm to find one. However, the matching obtained by this algorithm is man-optimal, that is, the matching is preferable for men but unpreferable for women, (or, if we exchange the role of men and women, the resulting...
Let (L,*) be a semilattice, and let c: L →[0, ∞ ) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k with 1 ≤ k ≤ n, find a size k sub-collection (x′1, x′2, ..., x′k) of X that minimizes c(x′1 * x′2 * ⋯ * x′k). If c(a * b) ≤ c(a) + c(b) holds, we call this the Minimum Subadditive...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.