448 search results - page 36 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
VMV
2008
13 years 9 months ago
2008
Visualizing 3D flow fields intrinsically suffers from problems of clutter and occlusion. A common practice to alleviate these issues is to restrict the visualization to feature su...
SIAMNUM
2010
13 years 2 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
SIAMSC
2010
13 years 2 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...