IJSNET
2008
13 years 11 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
IPCO
1993
14 years 6 days ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
AAIM
2010
Springer
14 years 2 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
PPAM
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
WG
2007
Springer
14 years 5 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
AAIM
2007
Springer
14 years 5 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
AAIM
2008
Springer
14 years 5 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
AAIM
2008
Springer
14 years 5 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...