Results 1  10
of
3,613,831
Bicriteria network design problems
 In Proc. 22nd Int. Colloquium on Automata, Languages and Programming
, 1995
"... We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a ¡subgraph from a given subgraphclass that minimizes ..."
Abstract

Cited by 88 (13 self)
 Add to MetaCart
We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a ¡subgraph from a given subgraph
Sonet Network Design Problems
"... This paper presents a new method and a constraintbased objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP). Th ..."
Abstract
 Add to MetaCart
This paper presents a new method and a constraintbased objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP
A ReliabilityBased Network Design Problem
, 2016
"... A reliability‐based network design problem ..."
The Access Network Design Problem
, 1998
"... We consider the problem of designing a minimum costaccess network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types areavailable for leasing or buying. Some trunktypes have a high initial overhead cost but a low cost per unit bandwidth. Others have a ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
We consider the problem of designing a minimum costaccess network to carry traffic from a set of endnodes to a core network. A set of trunks of K differing types areavailable for leasing or buying. Some trunktypes have a high initial overhead cost but a low cost per unit bandwidth. Others have a
Improved Approximation Algorithms for Network Design Problems
, 1994
"... We consider a class of network design problems in which one needs to find a minimumcost network satisfying certain connectivity requirements. For example, in the survivable network design problem, the requirements specify that there should be at least r(v; w) edgedisjoint paths between each pai ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
We consider a class of network design problems in which one needs to find a minimumcost network satisfying certain connectivity requirements. For example, in the survivable network design problem, the requirements specify that there should be at least r(v; w) edgedisjoint paths between each
ServiceConstrained Network Design Problems
, 1996
"... . Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): find a lowcost network, under one cost function, that services every node in the graph, under another cost funct ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): find a lowcost network, under one cost function, that services every node in the graph, under another cost
On the Approximability of Some Network Design Problems
, 2005
"... Consider the following classical network design problem: aset of terminals T = ftig wants to send traffic to a "root" r in an nnode graph G = (V; E). Each terminal ti sends di units of traffic, and enough bandwidth has to be allocatedon the edges to permit this. However, bandwidth on an ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
Consider the following classical network design problem: aset of terminals T = ftig wants to send traffic to a "root" r in an nnode graph G = (V; E). Each terminal ti sends di units of traffic, and enough bandwidth has to be allocatedon the edges to permit this. However, bandwidth
Oriented Networks Design Problem
"... The design of interconnection networks is very popular in computer science. In this paper we introduce a novel problem, the design of oriented networks. The underlying structure of such networks is a directed graph with weights on the arcs, which are the number of paths of the routing that traverse ..."
Abstract
 Add to MetaCart
The design of interconnection networks is very popular in computer science. In this paper we introduce a novel problem, the design of oriented networks. The underlying structure of such networks is a directed graph with weights on the arcs, which are the number of paths of the routing that traverse
Results 1  10
of
3,613,831