Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...

In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the sch...

Encryption key safety is the Achilles’ heel of modern cryptography. Simple backup copies offset the risk of key loss, but increase the danger of disclosure, including at the escrow’s site. Recoverable Encryption (RE) alleviates the dilemma. The backup is specifically encrypted so that recovery by brute force, i.e., without any hint from the key owner, remains possible. We propose RE using a noi...

The notion of recoverable value was advocated in work of Feige, Immorlica, Mirrokni and Nazerzadeh [Approx 2009] as a measure of quality for approximation algorithms. There this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS). We say that an approximation algorithm has recoverable value ρ, if for ev...

Smartcard is well adapted to store con dential data and to provide secure services in a mobile and distributed environment. But many cases of smartcard application failure can corrupt data in smartcard persistent memory. In this paper, we propose a recoverable persistent memory to maintain data consistency in a smartcard. Then, we adapt and compare two recovery algorithms used in Database Manag...

This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results ...

This paper describes an extensive study of the reversebias degradation of AlGaN/GaN-based High Electron Mobility Transistors. The analysis was carried out by means of combined electrical characterization and timeresolved electroluminescence measurements. Results indicate that: (i) AlGaN/GaN HEMTs can degrade even below the “critical voltage” identified by means of stepstress experiments. (ii) d...

The paper studies frequency criterions of recoverability of a single missing value from an observed sequence. Stochastic Gaussian stationary processes that are non recoverable in this sense are called minimal processes; they have a degenerate spectral density. The paper considers this problem in a pathwise setting without probabilistic assumptions; recoverability criterions are formulated in th...

Distributed Shared Memory (DSM) systems implemented on a network of workstations (NOW) have become a convenient alternative to shared memory archi-tectures to execute long running parallel applications. However, such architectures are susceptible to experience failures. This paper presents the design and implementation of a recoverable DSM (RDSM) based on a backward error recovery (BER) mechani...

This paper presents an efficient fair document exchange protocol. The exchange of the documents will be between two parties. The protocol is based on the verifiable and recoverable encryption of a document’s key. This verifiable and recoverable encryption of the document’s key will allow one party to verify the encrypted key. It will also ensure this party that the Semi Trusted Third Party will...