1963 search results - page 79 / 393 » The Maximum Solution Problem on Graphs |
106
click to vote
IPL
2006
15 years 2 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
140
click to vote
ADHOCNOW
2009
Springer
15 years 3 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
104
click to vote
PPSN
2000
Springer
15 years 6 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
111
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
128
Voted
DATE
2006
IEEE
15 years 6 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...