Sciweavers

817 search results - page 16 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
TR
2008
107views more  TR 2008»
13 years 8 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
IOR
2008
109views more  IOR 2008»
13 years 8 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
MP
2006
84views more  MP 2006»
13 years 8 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 9 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 8 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman