In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverab...

data type interface class (Figure 7.13). There is an explicit abstract base class for each data type, from which both the regular and the recoverable version are derived. derive recoverable from regular versions (Figure 7.14). We use the regular classes as base classes for the recoverable versions. 7.4. DETAILED DESIGN AND IMPLEMENTATION 147

This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A strongly polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem generalizes the incremental spanning tree problem, previously discussed in literature. The algorithm built is then applied to solve the recoverable robust sp...

A number of recent publications explain NBTI to be due to a recoverable and a more permanent component. While a lot of information has been gathered on the recoverable component, the permanent component has been somewhat elusive. We demonstrate that oxide defects commonly linked to the recoverable component also form an important contribution to the permanent component of NBTI. As such, they ca...

In this paper, we propose a recoverable DSM that uses a competitive update protocol. In this update protocol, multiple copies of each page may be maintainedat different nodes. However, it is also possible fora page to exist in only one node, as some copies of the page may be invalidated. We propose an implementation that makes the competitive update protocol recoverable from a single node failu...

We present a new concept for optimization under uncertainty: recoverable robustness. A solution is recovery robust if it can be recovered by limited means in all likely scenarios. Specializing the general concept to linear programming we can show that recoverable robustness combines the flexibility of stochastic programming with the tractability and performances guarantee of the classical robus...

We show that expander codes, when properly instantiated, are high-rate list-recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently listdecodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list-recoverable codes with linear-time decoding algorithms have...

A number of recent publications explain NBTI to consist of a recoverable and a more permanent component. While a lot of information has been gathered on the recoverable component, the permanent component has been somewhat elusive. We demonstrate that oxide defects commonly linked to the recoverable component also form an important contribution to the permanent component of NBTI. As such, they c...

This paper addresses a model problem of nonlinear homogenization motivated by the study of the shape-memory effect in polycrystalline media. Specifically, it numerically computes the set of recoverable strains in a polycrystal given the set of recoverable strains of a single crystal in the two dimensional scalar (or antiplane shear) setting. This problem shares a direct analogy with crystal pla...