We present an algorithm that recognizes the class of General Series Parallel digraphs and runs in time proportional to the size of its input. To perform this recognition task it is necessary toâ€¦ (More)

18th Annual Symposium on Foundations of Computerâ€¦

1977

Fully polynomial approximation algorithms for knapsack problems are presented. These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, andâ€¦ (More)

It IS shown that certain problems of optimal preemptive scheduling of unrelated parallel processors can be formulated and solved as hnear programming problems As a by-product of the linearâ€¦ (More)

Given a text string of lengthn and a pattern string of lengthm over ab-letter alphabet, thek differences approximate string matching problem asks for all locations in the text where the patternâ€¦ (More)

It is well-knorl, 1 that the chromatic number prob%n i;; MPcomplete. In fact, even the problem of detezmloling the chromatic number of an arb?rary graph to within a given factor r < 2 has also beenâ€¦ (More)

line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for theâ€¦ (More)

Suppose that an independence system (E, ) is characterized by a subroutine which indicates in unit time whether or not a given subset of E is independent. It is shown that there is no algorithm forâ€¦ (More)