#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1963

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zoë Abrams, Ashish Goel, Serge A. Plotkin
- Third International Symposium on Information…
- 2004

Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers iteratively in a round-robin fashion. This approach takes advantage of the overlap created when many sensors monitor a… (More)

- Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
- FOCS
- 1993

We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to completion and no reroutings are allowed. The “no rerouting” restriction appears in all the proposals for future high-speed networks and stems from current… (More)

- Philip N. Klein, Serge A. Plotkin, Satish Rao
- STOC
- 1993

In this paper we show that, given a graph and parameters 6 and r, we can find either a K,,. minor or an edge-cut of size O(mT/6) whose removal yields components of weak diameter O(T-26); i.e., every pair of nodes in such a component are at distance 0(r26) in the original graph. Using this lemma, we improve the best known bounds for the rein-cut max-flow… (More)

- James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
- J. ACM
- 1997

In this paper we study the problem of on-line allocation of routes to virtual circuits (both <italic>point-to-point</italic> and <italic>multicast</italic>) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of <italic>Permanent</italic> virtual circuits (i.e., once a circuit is established it exists… (More)

- Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
- SIAM J. Discrete Math.
- 1987

We describe efficient deterministic techniques for breaking symmetry in parallel. The techniques work well on rooted trees and graphs of constant degree or genus. Our primary technique allows us to 3-color a rooted tree in <italic>&Ogr;</italic>(lg<supscrpt>*</supscrpt><italic>n</italic>) time on an EREW PRAM using a linear number of processors. We apply… (More)

We introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component into a single node has low chromatic number and low arboricity. We present an eecient distributed algorithm for constructing such a decomposition, and demonstrate its use… (More)

We consider a class of network design problems in which one needs to nd a minimum-cost network satisfying certain connectivity requirements. For example, in the sur-vivable network design problem, the requirements specify that there should be at least r(v; w) edge-disjoint paths between each pair of vertices v and w. We present an approximation algorithm… (More)

- Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
- SIAM J. Comput.
- 2000

We present the COST-DISTANCE problem: finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known randomized approximation scheme for COST-DISTANCE, where is the number of sources. We reduce several common network design problems to… (More)

- James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
- STOC
- 1993

In this paper we study an idealized problem of on-line allocation of routes to virtual circuits where the goal is to minimize the required bandwidth. For the case where virtual circuits continue to exist forever, we describe an algorithm that achieves an O (log n) competitive ratio, where n is the number of nodes in the network. Informally, our results show… (More)

- Serge A. Plotkin, Satish Rao, Warren D. Smith
- SODA
- 1994

In this paper we introduce the notion of the limited-depth minor exclusion and show that graphs that exclude small limited-depth minors have relatively small separators. In particular, we prove that for any graph that excludes Kh as a depth l minor, we can find a separator of size O(lh2 logn + n=l). This, in turn, implies that any graph that excludes Kh as… (More)