On an extension of the Sort & Search method with application to scheduling theory - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2013

On an extension of the Sort & Search method with application to scheduling theory

Abstract

In this paper, we focus on the Sort & Search method initially proposed by Horowitz and Sahni (1974) [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms for some scheduling problems. We propose an extension of this method to a general class of problems called Multiple Constraint Problems and show that the extended Sort & Search method enables one to derive new exponential-time algorithms, with O*(m(n/2)) worst-case complexity, for two scheduling problems.

Dates and versions

hal-00942913 , version 1 (06-02-2014)

Identifiers

Cite

Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent t'Kindt. On an extension of the Sort & Search method with application to scheduling theory. Theoretical Computer Science, 2013, 511, pp.13-22. ⟨10.1016/j.tcs.2013.05.023⟩. ⟨hal-00942913⟩
58 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More