Results 1  10
of
891
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
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
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
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
Distributed Maintenance of Minimumcost Path Information in Wireless Sensor Networks
"... The quality of the communication links in a Wireless Sensor Network often shows significant asymmetry and variation over time, due to, for example, heterogeneous settings of the transmission power, moving nodes or changing external interference. This makes it difficult for nodes to accurately mainta ..."
Abstract
 Add to MetaCart
. Using controlled nhop forwarding, to deal with asymmetric links, every node disseminates minimumcost path and connectivity information allowing every connected node in the network to iteratively derive minimumcost path information. This controlled nhop forwarding is repeated to avoid stale
Efficient Minimumcost Bandwidthconstrained Routing in Wireless Sensor Networks +
"... Abstract — A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many routing schemes proposed in the literature try to minimize the energy consumed in routing or maximize the lif ..."
Abstract
 Add to MetaCart
minimizes the total cost of routing while guaranteeing that the load on each wireless link does not exceed its capacity. The protocol is derived from a combinatorial optimization problem, known as the minimumcost flow problem in the operations research literature. Because we use polynomialtime minimumcost
Implicit computation of minimumcost feedbackvertex sets for partial scan and other applications
 In: Proc. design automation conference, pp 77–80
, 1994
"... The contribution of this paper is an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, we efficiently derive a Boolean function whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the grap ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
The contribution of this paper is an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, we efficiently derive a Boolean function whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles
Multiwafer virtual probe: Minimumcost variation characterization by exploring wafertowafer correlation
 in Proc. Int. Conf. Comput.Aided Des., 2010
"... In this paper, we propose a new technique, referred to as MultiWafer Virtual Probe (MVP) to efficiently model waferlevel spatial variations for nanoscale integrated circuits. Towards this goal, a novel Bayesian inference is derived to extract a shared model template to explore the wafertowafer c ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
In this paper, we propose a new technique, referred to as MultiWafer Virtual Probe (MVP) to efficiently model waferlevel spatial variations for nanoscale integrated circuits. Towards this goal, a novel Bayesian inference is derived to extract a shared model template to explore the wafer
MinimumCost QoSConstrained Deployment and Routing Policies for Wireless Relay Networks
"... With the continued evolution of wireless communication technology, relaying is one of the features proposed for the 4G LTE Advanced (LTEA) system. The aim of relaying is to enhance both coverage and capacity. The idea of relays is not new, but relaying is being considered to ensure that the optimu ..."
Abstract
 Add to MetaCart
many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a multicast tree routing algorithm to both determine and fulfill the QoS requirements to enhance throughput, but we also utilize the Lagrangian relaxation (LR) method
Results 1  10
of
891