Volume 63, Issue 4

August 2012

Special Issue: Algorithm Design and Analysis

Issue Editor:

8 articles in this issue

Guest Editorial
Mark de Berg
EditorialNotes Open access 10 February 2012 Pages: 731 - 732
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Nikhil Bansal
Anupam Gupta
Atri Rudra
OriginalPaper 09 April 2011 Pages: 733 - 762
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
Vincenzo Bonifaci
Alberto Marchetti-Spaccamela
OriginalPaper 18 March 2011 Pages: 763 - 780
Caching Is Hard—Even in the Fault Model
Marek Chrobak
Gerhard J. Woeginger
Haifeng Xu
OriginalPaper Open access 10 March 2011 Pages: 781 - 794
Local Search Algorithms for the Red-Blue Median Problem
M. Hajiaghayi
R. Khandekar
G. Kortsarz
OriginalPaper 12 July 2011 Pages: 795 - 814
On Space Efficient Two Dimensional Range Minimum Data Structures
Gerth Stølting Brodal
Pooya Davoodi
S. Srinivasa Rao
OriginalPaper 23 February 2011 Pages: 815 - 830
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Emmanouil Pountourakis
Angelina Vidali
OriginalPaper 08 December 2011 Pages: 831 - 860
f-Sensitivity Distance Oracles and Routing Schemes
Shiri Chechik
Michael Langberg
Liam Roditty
OriginalPaper 23 June 2011 Pages: 861 - 882

Search