Sciweavers

SODA
2010
ACM
133views Algorithms» more  SODA 2010»
14 years 2 months ago
Testing additive integrality gaps
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...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 2 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
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...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 2 months ago
Streaming Algorithms for extent problems in high dimensions
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...
Pankaj K Agarwal, R. Sharathkumar
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
14 years 2 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
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...
Noa Avigdor-Elgrabli, Yuval Rabani
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 2 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
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...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 2 months ago
Optimally Reconstructing Weighted Graphs Using Queries
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...
Hanna Mazzawi
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 2 months ago
Data-Specific Analysis of String Sorting
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 ...
Raimund Seidel
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 2 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu
SODA
2010
ACM
148views Algorithms» more  SODA 2010»
14 years 2 months ago
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
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...
Dave Buchfuhrer, Chris Umans