534 search results - page 40 / 107 » Tight approximation algorithm for connectivity augmentation ... |
164
click to vote
APWEB
2006
Springer
15 years 8 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
158
Voted
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
137
click to vote
NIPS
1996
15 years 6 months ago
1996
Abstract. In this paper we investigate the feed-forward learning problem. The well-known ill-conditioning which is present in most feed-forward learning problems is shown to be the...
178
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
143
click to vote
IPCO
2010
15 years 6 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...