3875 search results - page 228 / 775 » Approximation algorithms for the 0-extension problem |
152
Voted
LCN
2005
IEEE
15 years 11 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
162
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
148
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
167
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
155
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...