287 search results - page 33 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
140
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
128
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
127
click to vote
JC
2007
15 years 3 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
150
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
329
Voted
COCOON
2011
Springer
14 years 3 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...