7150 search results - page 283 / 1430 » An Approximation Algorithm for Approximation Rank |
165
click to vote
WADS
2007
Springer
16 years 23 days ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
149
click to vote
CPM
2004
Springer
16 years 1 days ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
189
click to vote
SWAT
2004
Springer
16 years 8 hour ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
187
click to vote
INFOCOM
1998
IEEE
1998
IEEE
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
15 years 11 months ago
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
156
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...