Results 1  10
of
2,565
An Approximation Algorithm for MinimumCost Network Design
 Institute of Science, Rehovot
, 1998
"... This paper considers the problem of designing a minimum cost network meeting a given set of traffic requirements between n sites, using one type of channels of a given capacity, with varying setup costs for different vertex pairs (comprised of a fixed part plus a part dependent on the pair). An ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
This paper considers the problem of designing a minimum cost network meeting a given set of traffic requirements between n sites, using one type of channels of a given capacity, with varying setup costs for different vertex pairs (comprised of a fixed part plus a part dependent on the pair
MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE
"... Abstract: We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear singlecommodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss stateoftheart algori ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract: We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear singlecommodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss state
Minimumcost network hardening using attack graphs
, 2006
"... In defending one’s network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemingly wellguarded network through a multistep intrusion, in which each step prepares for the next. Attack graphs can reveal th ..."
Abstract

Cited by 46 (11 self)
 Add to MetaCart
conditions. We then simplify the proposition to make hardening options explicit. Among the options we finally choose solutions with the minimum cost. The key improvements over the preliminary version of this paper include a formal framework of the minimum network hardening problem, and an improved one
AN EXPERIMENTAL IMPLEMENTATION OF THE DUAL CANCEL AND TIGHTEN ALGORITHM FOR MINIMUMCOST NETWORK FLOW
"... Abstract. We present an exerimental implementation of a variant of the Dual Cancel and Tighten (DCT) algorithm for MinimumCost Network Flow (MCNF). The algorithm maintains a dual feasible pi and a primal x necessarily satisfying only conservation. It then seeks to minimize the largest horizontal vi ..."
Abstract
 Add to MetaCart
Abstract. We present an exerimental implementation of a variant of the Dual Cancel and Tighten (DCT) algorithm for MinimumCost Network Flow (MCNF). The algorithm maintains a dual feasible pi and a primal x necessarily satisfying only conservation. It then seeks to minimize the largest horizontal
Relaxation methods for minimum cost network flow problems
, 1988
"... We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is reminiscent of coordinate ascent and GaussSeidel relaxation methods. We compare our coded implementat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is reminiscent of coordinate ascent and GaussSeidel relaxation methods. We compare our coded
Efficient minimumcost network hardening via exploit dependency graphs
 In ACSAC
, 2003
"... Indepth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to compute attack paths (combinations of exploits), from which one can decide whether a given set of network hardening measures ..."
Abstract

Cited by 81 (10 self)
 Add to MetaCart
guarantees the safety of given critical resources. We go beyond attack paths to compute actual sets of hardening measures (assignments of initial network conditions) that guarantee the safety of given critical resources. Moreover, for given costs associated with individual hardening measures, we compute
The relax codes for linear minimum cost network flow problems
 Annals of Operations Research
, 1988
"... We describe a relaxation algorithm [ 1,2] for solving the classical minimum cost network flow problem. Our implementation is compared with mature stateoftheart primal simplex and primaldual codes and is found to be several times faster on all types of randomly generated network flow problems. Fu ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We describe a relaxation algorithm [ 1,2] for solving the classical minimum cost network flow problem. Our implementation is compared with mature stateoftheart primal simplex and primaldual codes and is found to be several times faster on all types of randomly generated network flow problems
Approximation Algorithms for DegreeConstrained MinimumCost NetworkDesign Problems
, 2001
"... We study networkdesign problems with two different design objectives: the total cost of the edges and nodes in the network and the maximum degree of any node in the network. A prototypical example is the degreeconstrained nodeweighted Steiner tree problem: We are given an undirected graph ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
is and the cost of the tree is times that of a minimumcost Steiner tree that obeys the degree bound for each node . Our result extends to the more general problem of constructing oneconnected networks such as generalized Steiner forests. We also consider the special case in which the edge
A NEW SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM KARAGIANNIS PANAGIOTIS
"... A new primal simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs ..."
Abstract
 Add to MetaCart
A new primal simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs
Results 1  10
of
2,565