Results 11  20
of
189,347
Multicast Routing for Multimedia Communication
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend delay along the paths from source to each destination, and ii) minimum cost of the multicast tree, where edge cost and edge delay can be independent metrics. This problem of computing such ..."
Abstract

Cited by 219 (9 self)
 Add to MetaCart
We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend delay along the paths from source to each destination, and ii) minimum cost of the multicast tree, where edge cost and edge delay can be independent metrics. This problem of computing
BASIC COSTS OF SLUM UPGRADING IN BRAZIL
"... Slum areas in Brazil have expanded greatly, and particularly in the last two decades. The initiatives taken by the government in relation to this issue have evolved from superficial actions and measures aimed at minimizing infrastructure deficiencies to broader interventions seeking to consolidate n ..."
Abstract
 Add to MetaCart
is to assist in planning and examining strategic concepts for interventions in informal urban areas by compiling basic costs and technical data associated with understanding these items. Conclusions and recommendations are listed in relation to general guidelines for interventions, to upgrading costs
Upgrading Shortest Paths in Networks
"... Abstract. We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to wildlife habitat conservation. We define the problem in terms of a network with node delays and a set of node ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
upgrade actions, each associated with a cost and an upgraded (reduced) node delay. The goal is to choose a set of upgrade actions to minimize the shortest delay paths between demand pairs of terminals in the network, subject to a budget constraint. We show that this problem is NPhard. We describe
The price of anarchy is independent of the network topology
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 2002
"... We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to ..."
Abstract

Cited by 217 (17 self)
 Add to MetaCart
to selfishly route traffic on minimumlatency paths. The quality of a routing of traffic is measured by the sum of travel times, also called the total latency. The outcome of selfish routing—a Nash equilibrium—does not in general minimize the total latency; hence, selfish behavior carries the cost of decreased
Improving minimum cost spanning trees by upgrading nodes
 J. Alg
, 1999
"... This Article is brought to you for free and open access by Research Showcase @ CMU. It has been accepted for inclusion in Tepper School of Business ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This Article is brought to you for free and open access by Research Showcase @ CMU. It has been accepted for inclusion in Tepper School of Business
Finding MinimumCost Paths with Minimum Sharability
"... Abstract — In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and reliability. We introduce the notion of link sharability and node sharability, and consider the problems of finding mini ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
minimumcost k paths subject to minimum link/node sharability constraints. We identify 65 different link/node sharability constraints, and consider the fundamental problem of finding minimumcost k paths between a pair of nodes under these constraints. We present a unified polynomialtime algorithm scheme
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
Computing Minimum Length Paths of a Given Homotopy Class
 Comput. Geom. Theory Appl
, 1991
"... In this paper, we show that the universal covering space of a surface can be used to unify previous results on computing paths in a simple polygon. We optimize a given path among obstacles in the plane under the Euclidean and link metrics and under polygonal convex distance functions. Besides reveal ..."
Abstract

Cited by 93 (6 self)
 Add to MetaCart
revealing connections between the minimum paths under these three distance functions, the framework provided by the universal cover leads to simplified lineartime algorithms for shortest path trees, for minimumlink paths in simple polygons, and for paths restricted to c given orientations. 1 Introduction
Robust discrete optimization and network flows
 Mathematical Programming Series B
, 2003
"... We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows controlling the degree of conservatism of the solution, and is computationally tractable both practically and theoretically. In particular, when both the cost coefficients and the data ..."
Abstract

Cited by 194 (27 self)
 Add to MetaCart
network flows that solves the robust counterpart by solving a polynomial number of nominal minimum cost flow problems in a modified network.
Upgrading Links For Performance *
"... The performance of a computer network is commonly measured by the maximum minimum time required to move certain amount of data between any 2 nodes in the network. Due to the advances in technology, links in the network may now be upgraded, for instance to optical fibre links, so that better performa ..."
Abstract
 Add to MetaCart
performance can be achieved. In this paper, we study the LINK UPGRADE problem for networks. We first show that the LINK UPGRADE problem is NPcomplete. We also show that, a closely related problem, the MINIMUM COST LINK UPGRADE problem is NPcomplete even if the underlying topology of the network is a
Results 11  20
of
189,347