2137 search results - page 234 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
201
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
157
click to vote
AAAI
2004
15 years 7 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
218
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
15 years 1 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
191
Voted
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
167
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...