4843 search results - page 166 / 969 » The Shortcut Problem - Complexity and Approximation |
132
click to vote
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
120
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
128
Voted
CCCG
2007
15 years 4 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
131
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
147
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...