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...
Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Jana...
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...
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...
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...