438 search results - page 7 / 88 » A (1-1 e)-approximation algorithm for the generalized assign... |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
COMCOM
2007
13 years 7 months ago
2007
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...