1671 search results - page 29 / 335 » On the Covering Steiner Problem |
203
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
180
click to vote
AAIM
2006
Springer
16 years 11 hour ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
151
click to vote
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
157
click to vote
ESORICS
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
151
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...