1629 search results - page 21 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
105
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
110
click to vote
WEBDB
2010
Springer
14 years 7 months ago
2010
Springer
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
ICWS
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...