331 search results - page 48 / 67 » Approximation Algorithms for Connected Dominating Sets |
111
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
IPCO
2010
15 years 1 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
102
click to vote
IJCV
2006
14 years 11 months ago
2006
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
SMA
2005
ACM
15 years 5 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...