3874 search results - page 99 / 775 » Approximation Algorithms for k-hurdle Problems |
131
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
122
click to vote
IJFCS
2002
15 years 1 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
122
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
129
click to vote
ICC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...