12519 search results - page 257 / 2504 » Approximation Problems Categories |
208
click to vote
TIT
2011
15 years 2 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
200
click to vote
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
205
click to vote
WAOA
2007
Springer
16 years 1 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...
180
click to vote
WEA
2007
Springer
16 years 1 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...
187
click to vote
CCCG
2007
15 years 8 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...