Sciweavers

78 search results - page 5 / 16
» Differential Approximation for Some Routing Problems
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 3 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 1 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
ICCCN
2008
IEEE
14 years 3 months ago
A Distributed Routing Algorithm for Networks with Data-Path Services
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
Xin Huang, Sivakumar Ganapathy, Tilman Wolf
NA
2010
96views more  NA 2010»
13 years 7 months ago
Spectral element methods on unstructured meshes: which interpolation points?
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
Richard Pasquetti, Francesca Rapetti