Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We introduce the Constrained Least-cost Tour (CLT) problem: given an undirected graph with weight and cost functions on the edges… Expand

2018

2018

Resilience as well as other objectives like censorship-resistance demand the existence of multiple diverse paths between two… Expand

2017

2017

We address the problem of survivable path pair routing in multi- domain optical networks with geographically correlated failures… Expand

2017

2017

Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies enable a fast way of deploying network… Expand

2012

2012

We propose an algorithm to find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain… Expand

2004

2004

Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails when… Expand