Exploring Unknown Environments
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming
Journal of Graph Theory
On polynomial-time approximation algorithms for the variable length scheduling problem
Theoretical Computer Science
Approximate and dynamic rank aggregation
Theoretical Computer Science - Special papers from: COCOON 2003
Scheduling intervals using independent sets in claw-free graphs
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Hi-index | 5.23 |
Based on applications to efficient information gathering over the Web, Czumaj et al. (Algorithms and data structures (Vancouver, BC, 1999), Lecture Notes in Computer Science, Vol. 1663, Springer, Berlin, 1999, p. 297) studied the Variable Length Sequencing Problem (VLSP), showed it is NP-complete, presented a polynomial time algorithm for a very restricted version and an approximation algorithm for a slightly less restricted version. In this paper, we pin-point the difficulty by showing that it is N-P-complete in a strong sense even to approximating the VLSP within a factor nk for any fixed integer k. In addition, we show it is NP-hard to find the optimal solution even when all jobs follow the periodic property. Motivated by the NP-hardness of approximating VLSP, we consider an optimal version of maximizing the number of completed tasks and present an approximation algorithm with factor 2 and a polynomial time algorithm for optimal solution in the special case when the number of different types of tasks is restricted.