This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...