Polynomial Complete Consecutive Information Retrieval Problems
TL;DR: Both of the computational complexity of these problems are shown to be polynomial complete in the sense of Cook [2] an...
read more
Abstract: A set of queries Q is said to have the consecutive retrieval property with respect to a set of records R if there exists an organization of the record set (without duplication of any record) such t...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On the Computational Complexity of Combinatorial Problems
TL;DR: A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time.
749
Minimizing the number of tool switches on a flexible machine
TL;DR: In this paper, a tool management problem for flexible machines is discussed, where the problem is to decide how to sequence the parts to be produced, and what tools to allocate to the machine, in order to minimize the number of tool setups.
163
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
TL;DR: The problem of cyclic staff scheduling is solved by a linear programming round-off heuristic for which a bound on the absolute error is established and the quality of the bound improves as the matrix of resource availability approximates the property of consecutive ones.
144
More on the complexity of common superstring and supersequence problems
TL;DR: The main results are: cyclic and permutation variants of SCSt and SCSe are NP-complete for strings of length 3 and polynomial-time-solvable for string of length 2, and permutation-SCSe and cyclic-SCSt are defined analogously.
62
Computational Complexity of Combinatorial and Graph-Theoretic Problems
R. M. Karp
- 01 Jan 2011
TL;DR: This series of lectures is concerned with efficient algorithms which operate on graphs, a structure consisting of a finite set of vertices, certain pairs of which are joined by edges.
60
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Incidence matrices and interval graphs
TL;DR: In this article, the problem of determining when a graph is an interval graph is a special case of the following problem concerning (0, 1)-matrices: when can the rows of such a matrix be permuted so as to make the 1's in each colum appear consecutively.
File organization: the consecutive retrieval property
TL;DR: Conditions under which the consecutive retrieval property exists and remain invariant have been established and an outline for designing an information retrieval system based on the consecutive retrieved property is discussed.
95
Consecutive storage of relevant records with redundancy
TL;DR: This paper studies the properties of a new class of file organizations (CRWR) where records relevant to every query are stored in consecutive storage locations but the organizations contain redundancy.
51