We discuss open questions around worst case time and space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior.

In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ž . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M Ž Ž . . important role. Lee and Lee J. Assoc. Comput. Mach. 32 1985 , 562]572 and Ž Ž . . Galambos Ann. Unï . Sci. Budapest Sect. Comput. 9 1988 , 121]126 pr...

We discuss several simple strategies for constructing binary search trees. Upper and lower bounds for the average and worst case search time in trees constructed according to these strategies are derived. Furthermore, different implementations are discussed and the results are applied to digital searching.

The examples published by Klee and Minty in 1972 do not preclude the existence of a pivot rule which will make the simplex method, at worst, polynomial. In fact, the continuing success of Dantzig's method suggests that such a rule does exist. A study of known examples shows that (a) those which use selective pivot rules require exponentially large coe cients, and (b) none of the examples' pivot...

Most hard real-time systems that incorporate database components assume that the data is resident in main memory. For these systems, priority ceiling protocols can be used to limit priority inversion. In this paper we consider disk resident data, additionally we assume optimistic concurrency control with abort and restart. Hence, when a high priority transaction requires access to the disk it w...

Any algorithm for finding a pattern of length k in a string of length n must examine at least n k + of the characters of the string in the worst case. By considering the pattern 00 0, we prove that this is the best possible result. Therefore there do not exist pattern matching algorithms whose worst-case behavior is "sublinear" in n (that is, linear with constant less than one), in contrast wit...

In the early 1970s, by work of Klee and Minty (1972) and Zadeh (1973), the Simplex Method, the Network Simplex Method, and the Successive Shortest Path Algorithm have been proved guilty of exponential worst-case behavior (for certain pivot rules). Since then, the common perception is that these algorithms can be fooled into investing senseless effort by ‘bad instances’ such as, e. g., Klee-Mint...

STUCKEY, JEFFREY J. Worst-Case Cell Delay in an ATM Switch using EDF Scheduling. (Under the direction of Professor George N. Rouskas and Professor Ioannis Viniotis.) Asynchronous Transfer Mode (ATM) is well-suited for carrying real-time tra c. Because real-time tra c must arrive at its destination prior to its playback instant, end-toend delay is one of its most critical QoS parameters. We focu...

This report documents the program and the outcomes of Dagstuhl Seminar 14372 “Analysis of Algorithms Beyond the Worst Case”. The theory of algorithms has traditionally focused on worst-case analysis. This focus has led to both a deep theory and many beautiful and useful algorithms. However, there are a number of important problems and algorithms for which worst-case analysis does not provide us...

We study the asymptotic behavior of P(X − Y > u) as u → ∞, where X is subexponential, Y is positive and the random variables X,Y may be dependent. We give criteria under which the subtraction of Y does not change the tail behavior of X. It is also studied under which conditions the comonotonic copula represents the worst-case scenario for the asymptotic behavior in the sense of minimizing the t...