219 search results - page 42 / 44 » A Better Approximation Ratio for the Vertex Cover Problem |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
ESA
2004
Springer
14 years 25 days ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
ECCC
2007
13 years 7 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...