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.
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O* (1.657n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O*(2n) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's...
The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its sub problems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a...
Optimization problems solved using very large scale neighborhood (VLSN) search algorithms include scheduling problems, the capacitated minimum spanning tree problem, the traveling salesman problem, and weapon-target assignment (WTA). This correspondence paper presents an enhanced VLSN search algorithm for obtaining feasible solutions and constructing improvement graphs. This enhanced VLSN search algorithm...
This study investigates finding a fuzzy shortest path based on interval-valued fuzzy numbers and signed distance ranking defuzzification method. In this problem, we consider each edge weight of the network as unknown, which means that the precise value for each edge weight is not known at all, but some sample data are available. We propose an approach to combine statistics with fuzzy sets and then...
In this paper, we propose an algorithm to search the optimal cycle cover in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with vertex set V and edge set E. Given a specified vertex set SVsubeV(G), a cycle cover is a cycle C of G such that every vertex in SV lies in cycle C. A cycle cover is called optimal if its cost is minimum. Cycle cover problem plays an important role in...
With the rapid growth of network bandwidth and high-capacity storage devices, videos have become an important way of communication in the aerospace industry and many other entities. However, browsing and managing huge video databases are quite tedious. To solve the problem, in this paper, we propose a novel video summarization framework, and discuss its potential usage in the document preparation...
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.