We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the resulting matrix rank. Matrix completion belongs to the fundamental problems in computational complexity with numerous important algorithmic applications, among o...

Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half–duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over di...

In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates.

Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(logn) for a very general class of problems, we give a best possible cost sharing method for m...

In order to produce specific complex structures from a large set of similar biochemical building blocks, many biochemical systems require high sensitivity to small molecular differences. The first and most common model used to explain this high specificity is kinetic proofreading, which has been extended to a variety of systems from detection of DNA mismatch to cell signaling processes. While t...

The completion time analysis of Markov reward models with partial incremental loss is provided in this paper. The complexity of the model behaviour requires the use of an extra (supplementary) variable.

The ever increasing adoption of mobile devices with limited energy storage capacity, on the one hand, and more awareness of the environmental impact of massive data centres and server pools, on the other hand, have both led to an increased interest in energy management algorithms. In this talk we will present several new constant factor approximation algorithms for energy aware scheduling probl...

Power consumption costs takes upto half of operational expenses of datacenters making power management a critical concern. Advances in processor technology provide finegrained control over operating frequency and voltage of processors and this control can be used to tradeoff power for performance. Although many power and performance models exist, they have a significant error margin while predi...

Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family {fm}m≥1 for arithmetic circuits. In this paper, a special case of CPIT is considered, namely non-singular matrix completion (NSMC) under a low-individual-degree promise. For this subclass ...

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...