632 search results - page 75 / 127 » On the Approximability of the Steiner Tree Problem |
153
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
150
Voted
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
163
click to vote
CORR
2011
Springer
15 years 24 days ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
149
Voted
FUIN
2010
15 years 3 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
175
Voted
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...