4894 search results - page 93 / 979 » The Guarding Problem - Complexity and Approximation |
128
click to vote
ARITH
2007
IEEE
16 years 17 days ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
173
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
156
click to vote
WEA
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
181
click to vote
NETWORKS
2006
15 years 6 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
180
click to vote
JCT
2008
15 years 6 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...