Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Abstract-- As the distance between terminals in modern wireless networks tends to decrease, the energy consumption issue, conventionally assumed to be exclusively dominated by the ...
Igor Stanojev, Osvaldo Simeone, Yeheskel Bar-Ness,...
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...