Results 31 to 40 of about 1,124,505 (266)
Learning-augmented maximum flow
Information Processing LettersWe propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily respect the edge capacities of the actual instance (since these were unknown at the time of learning). We present
Polak, Adam, Zub, Maksym
openaire +3 more sources
Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities [PDF]
Yugoslav Journal of Operations Research, 2016 In this paper, a new problem on a directed network is presented. Let D be a feasible network such that all arc capacities are equal to U. Given a t > 0, the network D with arc capacities U - t is called the t-network.
Ghiyasvand Mehdi
doaj +1 more source
Approximation algorithm for maximum flow network interdiction problem [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We consider the maximum flow network interdiction problem. We provide a new interpretation of the problem and define a concept called ”optimalcut”.
M. Afsharirad
doaj +1 more source
A new approach to the maximum flow problem [PDF]
Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86, 1986 All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic).
Andrew V. Goldberg, Robert Endre Tarjan
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction The use of herbal medical preparation (HMP) is rising among pediatric oncology patients, often to manage treatment‐related symptoms. Their effectiveness remains uncertain, and the risk of herb–drug interactions is underestimated.
Orianne Mahot +6 more
wiley +1 more source
Maximum skew-symmetric flows and matchings [PDF]
Mathematical Programming, 2004 35 pages, 3 figures, to appear in Mathematical Programming, minor stylistic corrections and shortenings to the original ...
Andrew V. Goldberg +1 more
openaire +3 more sources
Re‐Irradiation in Pediatric Diffuse Midline Glioma: A Multi‐Institutional Retrospective Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with recurrent diffuse midline gliomas (DMGs) have limited therapeutic options at recurrence. Re‐irradiation (RT2) may be used at progression, but with uncertainty about the benefit. Methods We conducted a multi‐institutional retrospective study of children aged < 18 with DMG treated at three centers (Toronto, Canada ...
Ajay Thomas Alex +13 more
wiley +1 more source
Maximum Flows on Disjoint Paths [PDF]
, 2010 We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edge-disjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path.
Guyslain Naves +2 more
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survival after relapse in pediatric acute myeloid leukemia (AML) remains poor, highlighting the critical importance of identifying prognostic factors to guide optimal relapse management. Methods We investigated the prognostic impact of multiparameter flow cytometry (MFC) measurable residual disease (MRD) in 188 patients with first ...
Camilla Poulsen +21 more
wiley +1 more source
The Maximum Flow Problem for Oriented Flows.
, 2016 In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation.
Stanley Schade, Martin Strehler 0001
openaire +3 more sources