27692 search results - page 49 / 5539 » Where is ... |
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
PODC
2003
ACM
14 years 2 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...