274 search results - page 29 / 55 » The Polymatroid Steiner Problems |
ISPD
2003
ACM
15 years 6 months ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
86
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
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...
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...
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...