• Publications
  • Influence
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization
TLDR
It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism. Expand
Scheduling split intervals
TLDR
This work considers the problem of scheduling jobs that are given as groups of non-intersecting segments on the real line, and develops a 2-approximation algorithm for general instances, based on a novel version of the Local Ratio technique. Expand
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem
TLDR
A linear time approximation algorithm for the weighted set-covering problem is presented and produces a solution of weight which is at most twice the weight of an optimal solution. Expand
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
TLDR
Putting together the Nemhauser-Trotter local optimization algorithm and the local-ratio theorem yields several new approximation techniques which improve known results from time complexity, simplicity and performance-ratIO point of view. Expand
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
TLDR
It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism. Expand
A unified approach to approximating resource allocation and scheduling
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimumExpand
A unified approach to approximating resource allocation and scheduling
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimumExpand
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
TLDR
It is shown, through an implementation for minla, that optimal orientations of decomposition trees can produce arrangements of roughly the same quality as those produced by the best known heuristic, at a fraction of the running time. Expand
Multiple communication in multi-hop radio networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols forExpand
Multiple Communication in Multihop Radio Networks
Two tasks of communication in a multihop synchronous radio network are considered: Point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols forExpand
...
1
2
3
4
5
...