1671 search results - page 54 / 335 » On the Covering Steiner Problem |
93
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
142
click to vote
ISPD
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
117
Voted
ICDE
2009
IEEE
15 years 7 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
200
click to vote
ACID
2006
15 years 2 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
100
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...