7930 search results - page 157 / 1586 » Greedy in Approximation Algorithms |
179
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
115
click to vote
DATE
2008
IEEE
16 years 26 days ago
2008
IEEE
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
191
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
187
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
168
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...