369 search results - page 24 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
108
click to vote
SIAMCOMP
2010
15 years 10 days ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
124
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
148
click to vote
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
93
Voted
CCCG
2007
15 years 3 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
129
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...