7129 search results - page 249 / 1426 » Approximation Algorithms for Treewidth |
134
click to vote
IPCO
2010
15 years 2 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
118
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
127
click to vote
AAIM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
155
Voted
IPL
2002
15 years 3 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
122
click to vote
DAC
1998
ACM
15 years 8 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...