We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Abstract—The construction of world models typically requires laborious survey and cataloguing of a building’s contents. OpenRoomMap attempts to crowd-source this information by...
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...