2137 search results - page 55 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
121
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
123
Voted
CSR
2009
Springer
15 years 8 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
104
click to vote
CASES
2007
ACM
15 years 6 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
152
Voted
ALGOSENSORS
2009
Springer
15 years 8 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
106
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...