630 search results - page 24 / 126 » Hardness results for approximating the bandwidth |
110
click to vote
CC
2006
Springer
15 years 16 days ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
85
Voted
IPL
2008
15 years 14 days ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
104
Voted
NETWORKING
2004
15 years 1 months ago
2004
This paper addresses bandwidth allocation for an integrated voice/data broadband mobile wireless network. Specifically, we propose a new admission control scheme called EFGC, whic...
118
Voted
ISCC
2005
IEEE
15 years 6 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
112
Voted
GRID
2003
Springer
15 years 5 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...