1964 search results - page 52 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
130
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
161
click to vote
JALC
2002
15 years 4 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
124
Voted
EURODAC
1994
IEEE
15 years 9 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
131
click to vote
ALENEX
2008
15 years 6 months ago
2008
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
130
Voted
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...