1054 search results - page 32 / 211 » Capacitated Domination Problem |
135
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
112
click to vote
NIPS
2004
15 years 3 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
104
click to vote
ISPD
1999
ACM
15 years 6 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
124
click to vote
ASPDAC
1998
ACM
15 years 6 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
123
click to vote
ATMOS
2008
15 years 4 months ago
2008
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...