133 search results - page 17 / 27 » Approximating the Minimum Weight Triangulation |
APPROX
2005
Springer
14 years 8 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
CIAC
2000
Springer
13 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
IJSNET
2007
13 years 6 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...