3192 search results - page 127 / 639 » The minimum latency problem |
124
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
108
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
144
click to vote
WINET
2010
15 years 2 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
149
click to vote
NDSS
1999
IEEE
15 years 8 months ago
1999
IEEE
Suppose that messages have been signed using a user's signature private key during the period of time after a key compromise but before the compromise is detected. This is a ...
140
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...