19 search results - page 3 / 4 » The Constrained Minimum Weighted Sum of Job Completion Times... |
IPPS
2009
IEEE
14 years 2 days ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
COR
2008
13 years 5 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...