12519 search results - page 365 / 2504 » Approximation Problems Categories |
137
click to vote
TALG
2010
15 years 5 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
181
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
186
click to vote
TON
2012
13 years 9 months ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
193
click to vote
TNN
2010
15 years 1 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
141
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...