653 search results - page 63 / 131 » The size of minimum 3-trees |
97
Voted
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
109
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—With the advent of new applications, one of the primary applications supported in downlink cellular systems is streaming video. QoS for streaming video entails data transmission...
133
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ICPPW
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that minimum transmission power achieves the opt...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...