2354 search results - page 174 / 471 » Assignment Problems |
145
Voted
HPCC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
153
click to vote
WOWMOM
2006
ACM
16 years 3 days ago
2006
ACM
RTS-CTS handshake based protocols achieve “reliable unicast” by eliminating the hidden node problem effectively, however, these solutions are not directly or efficiently gene...
172
click to vote
TASE
2010
IEEE
15 years 26 days ago
2010
IEEE
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
170
Voted
IPL
2010
15 years 4 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
174
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...