Journal: Networks

Found 487 papers in total
Minimum work paths in elevated networks
2008,
A new variant of the shortest path problem involves a bicycle traveling from an origin...
Hide-and-seek games on a tree to which Eulerian networks are attached
2008,
We analyze the hide-and-seek game ⌈( G ) on certain networks G . The hider picks...
Shortest path network interdiction with asymmetric information
2008,
We consider an extension of the shortest path network interdiction problem. In this...
Reformulation and sampling to solve a stochastic network interdiction problem
2008,
The network interdiction problem involves interrupting an adversary's ability to...
Minimizing a stochastic maximum-reliability path
2008,
We consider a stochastic network interdiction problem in which the goal is to detect...
Price competition with elastic traffic
2008,
In this paper, we present a combined study of price competition and traffic control in...
Network search games, with arbitrary searcher starting point
2008,
We analyze a zero-sum game between a blind unit-speed searcher and a stationary hider...
A linear-time algorithm for broadcast domination in a tree
2009,
The broadcast domination problem is a variant of the classical minimum dominating set...
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
2009,
The smallest k-ECSS problem is, given a graph along with an integer k , find a...
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
2009,
Conventional Lagrangean preprocessing for the network Weight Constrained Shortest Path...
Searching symmetric networks with Utilitarian-Postman paths
2009,
We introduce the notion of a Utilitarian Postman (UP) path on a network Q as one which...
Approximation algorithms for channel allocation problems in broadcast networks
2006,
We study two packing problems that arise in the area of dissemination-based...
The bi-criteria doubly weighted center-median path problem on a tree
2006,
Given a tree network T with n nodes, let 𝒫 L be the subset of all discrete paths...
Variations of the prize-collecting Steiner tree problem
2006,
The prize-collecting Steiner tree problem is well known to be NP-hard. We consider...
Minimum multiple message broadcast graphs
2006,
Multiple message broadcasting is the process of multiple message dissemination in a...
Fixed tree games with multilocated players
2006,
This article introduces fixed tree games with multilocated players (FMP games), which...
Lower bounds for the relative greedy algorithm for approximating Steiner trees
2006,
The Steiner tree problem is to find a shortest subgraph that spans a given set of...
A column generation approach for SONET ring assignment
2006,
In this article we consider the SONET ring assignment problem (SRAP). The authors...
Distributed delay constrained multicast routing algorithm with efficient fault recovery
2006,
Existing distributed delay constrained multicast routing algorithms construct a...
The multiroute maximum flow problem revisited
2006,
We are given a directed network G = (V,A,u) with vertex set V , arc set A , a source...
An integer programming approach to routing in daisy networks
2006,
We are concerned with routing problems arising in special kinds of synchronous digital...
Exact methods based on node-routing formulations for undirected arc-routing problems
2006,
This article proposes a new transformation of undirected arc-routing problems into...
Upgrading arcs to minimize the maximum travel time in a network
2006,
In transportation and telecommunication systems, the performance of the underlying...
Approximation algorithms for some k-source shortest paths spanning tree problems
2006,
In this article, we investigate two spanning tree problems of graphs with k given...
Papers per page: