16596 search results - page 186 / 3320 » Generalized Assignment Problems |
101
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
117
click to vote
EOR
2010
15 years 2 months ago
2010
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
125
click to vote
ICCAD
1993
IEEE
15 years 6 months ago
1993
IEEE
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
118
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
116
Voted
WINE
2009
Springer
15 years 9 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...