2698 search results - page 318 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
180
click to vote
ICDCS
2006
IEEE
16 years 18 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
216
click to vote
SIAMJO
2010
15 years 5 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
156
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
154
click to vote
DAC
1998
ACM
16 years 7 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
205
click to vote
WINE
2007
Springer
16 years 20 days ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...