4843 search results - page 161 / 969 » The Shortcut Problem - Complexity and Approximation |
142
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
119
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
101
Voted
ANOR
2010
15 years 3 months ago
2010
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...
135
click to vote
IPL
2006
15 years 3 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
125
click to vote
JUCS
2008
15 years 3 months ago
2008
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...