4114 search results - page 105 / 823 » Efficient Algorithms for the 2-Center Problems |
130
Voted
4OR
2005
15 years 4 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
132
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
121
click to vote
WSC
2008
15 years 7 months ago
2008
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
152
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
168
Voted
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...