369 search results - page 38 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
122
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
103
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
ISAAC
2001
Springer
15 years 4 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
102
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...