2698 search results - page 244 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
180
click to vote
TCS
2008
15 years 6 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
208
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
196
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
146
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
157
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...