9842 search results - page 1351 / 1969 » The Complexity of the Matching-Cut Problem |
195
click to vote
PODC
2005
ACM
16 years 24 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
178
click to vote
SIGECOM
2005
ACM
16 years 24 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
202
click to vote
SPAA
2005
ACM
16 years 24 days ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
165
click to vote
COLT
2005
Springer
16 years 23 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
200
click to vote
DCOSS
2005
Springer
16 years 23 days ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...