465 search results - page 40 / 93 » On the Hardness of Range Assignment Problems |
PODC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
109
click to vote
SEW
2003
IEEE
15 years 5 months ago
2003
IEEE
Model-based software has become quite popular in recent years, making its way into a broad range of areas, including the aerospace industry. The models provide an easy graphical i...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
110
click to vote
BIRTHDAY
2009
Springer
15 years 3 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...