4843 search results - page 279 / 969 » The Shortcut Problem - Complexity and Approximation |
147
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
141
click to vote
ECCV
2008
Springer
15 years 5 months ago
2008
Springer
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...
155
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
141
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
116
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...