4843 search results - page 492 / 969 » The Shortcut Problem - Complexity and Approximation |
131
click to vote
COMPGEOM
2006
ACM
16 years 9 days ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
155
click to vote
COMPGEOM
2006
ACM
16 years 9 days ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
186
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
171
click to vote
SIBGRAPI
2005
IEEE
15 years 12 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
178
Voted
ECML
2005
Springer
15 years 12 months ago
2005
Springer
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...