Sciweavers

JDA
2008
94views more  JDA 2008»
13 years 11 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 11 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert