Sciweavers

3864 search results - page 138 / 773
» time 2005
Sort
View
EOR
2007
128views more  EOR 2007»
15 years 6 months ago
Value of capacity pooling in supply chains with heterogeneous customers
We investigate the value of pooling capacity in supply chains that serve product demands of different variabilities. We build and analyze models that integrate production queuing...
Apurva Jain
ICALP
2005
Springer
15 years 12 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
15 years 12 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
COMPGEOM
2005
ACM
15 years 8 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...