Results 1  10
of
70
An almostlineartime algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
"... In this paper we present an almost linear time algorithm for solving approximate maximum flow in undirected graphs. In particular, given a graph with m edges we show how to produce a 1−ε approximate maximum flow in time O(m 1+o(1) · ε −2). Furthermore, we present this algorithm as part of a general ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
In this paper we present an almost linear time algorithm for solving approximate maximum flow in undirected graphs. In particular, given a graph with m edges we show how to produce a 1−ε approximate maximum flow in time O(m 1+o(1) · ε −2). Furthermore, we present this algorithm as part of a
AN APPROXIMATE MAXFLOW MINCUT RELATION FOR Undirected Multicommodity Flow, . . .
, 1995
"... In this paper, we prove the first approximate maxflow mincut theorem for undirected mult icommodity flow. We show that for a feasible flow to exist in a mult icommodity problem, it is sufficient hat every cut's capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we prove the first approximate maxflow mincut theorem for undirected mult icommodity flow. We show that for a feasible flow to exist in a mult icommodity problem, it is sufficient hat every cut's capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all
Capacitated network design on undirected graphs
 In APPROXRANDOM
, 2013
"... In this paper, we study the approximability of the capacitated network design problem (CapNDP) on undirected graphs: GivenG = (V,E) with nonnegative costs c and capacities u on its edges, sourcesink pairs (si, ti) with demand ri, the goal is to find the minimum cost subgraph where the minimum (si ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper, we study the approximability of the capacitated network design problem (CapNDP) on undirected graphs: GivenG = (V,E) with nonnegative costs c and capacities u on its edges, sourcesink pairs (si, ti) with demand ri, the goal is to find the minimum cost subgraph where the minimum
Scribe: Anupam Last revised Lecture 23 1 Fast MaxFlow
"... Given undirected graph G(V, E) where each edge has capacity 1, the objective is to find the maximum flow from s to t, such that the flow on an edge does not exceed its capacity. The running time for the best known max flow algorithm until recently was O(m 3/2). We discuss the algorithm from [1] for ..."
Abstract
 Add to MetaCart
Given undirected graph G(V, E) where each edge has capacity 1, the objective is to find the maximum flow from s to t, such that the flow on an edge does not exceed its capacity. The running time for the best known max flow algorithm until recently was O(m 3/2). We discuss the algorithm from [1
Opaque controlflow integrity.
 In 22nd Annual Network and Distributed System Security Symposium, NDSS,
, 2015
"... AbstractA new binary software randomization and ControlFlow Integrity (CFI) enforcement system is presented, which is the first to efficiently resist codereuse attacks launched by informed adversaries who possess full knowledge of the inmemory code layout of victim programs. The defense mitigates ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
if the paper was prepared within the scope of employment. This has motivated copious work on defenses against codereuse threats. Prior defenses can generally be categorized into: CFI [1] and artificial software diversity CFI restricts all of a program's runtime controlflows to a graph of whitelisted
Maximum EdgeDisjoint Paths in kSums of Graphs
, 2013
"... We consider the approximability of the maximum edgedisjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( n) even for planar graphs [14] due to a simple topological ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider the approximability of the maximum edgedisjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( n) even for planar graphs [14] due to a simple topological
Scribe: Anupam Last revised Lecture 23
"... Given undirected graph G(V, E) where each edge has capacity 1, the objective is to find the maximum flow from s to t, such that the flow on an edge does not exceed its capacity. The running time for the best known max flow algorithm until recently was O(m 3/2). We discuss the algorithm from [1] for ..."
Abstract
 Add to MetaCart
Given undirected graph G(V, E) where each edge has capacity 1, the objective is to find the maximum flow from s to t, such that the flow on an edge does not exceed its capacity. The running time for the best known max flow algorithm until recently was O(m 3/2). We discuss the algorithm from [1
Recommended Citation
, 2004
"... We consider the allornothing multicommodity flow problem in general graphs. We are given a capacitated undirected graph G = (V, E, u) and set of k pairs s1t1, s2t2,..., sktk. Each pair has a unit demand. The objective is to find a largest subset S of {1, 2,..., k} such that for every i in S we can ..."
Abstract
 Add to MetaCart
We consider the allornothing multicommodity flow problem in general graphs. We are given a capacitated undirected graph G = (V, E, u) and set of k pairs s1t1, s2t2,..., sktk. Each pair has a unit demand. The objective is to find a largest subset S of {1, 2,..., k} such that for every i in S we
Network science Complex network Community detection
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:
Results 1  10
of
70