Results 11 to 20 of about 10,477 (184)
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization [PDF]
Journal of the ACM, 2017 We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [34]. For the uncapacitated problem formulation, the complexity bound O ( mn ( m + n
Neil Olver, László A. Végh
core +8 more sources
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees [PDF]
, 2023 General factors are a generalization of matchings. Given a graph G with a set π(v) of feasible degrees, called a degree constraint, for each vertex v of G, the general factor problem is to find a (spanning) subgraph F of G such that deg_F(v) ∈ π(v) for ...
Shao, Shuai, Živný, Stanislav
core +1 more source
Rethinking the correction for absorbing aerosols in the OMI- and TROPOMI-like surface UV algorithms [PDF]
Atmospheric Measurement Techniques, 2021 Satellite estimates of surface UV irradiance have been available since 1978 from the TOMS UV spectrometer and have continued with significantly improved ground resolution using the Ozone Monitoring Instrument (OMI 2004–current) and Sentinel 5 Precursor ...
A. Arola +6 more
doaj +1 more source
The inverse maximum flow problem with lower and upper bounds for the flow [PDF]
Yugoslav Journal of Operations Research, 2008 The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the distance (considering l1 norm) between the initial vector of bounds ...
Deaconu Adrian
doaj +1 more source
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid [PDF]
, 2008 We present a new algorithm for the problem of determining the intersection of a half-line \(\Delta_{u}=\{x\in \mathbb{R}^{N}\:|\:x=\lambda u\;\mathrm {for}\;\lambda \geq 0\}\) with a polymatroid. We then propose a second algorithm which generalizes the first algorithm and solves a parametric linear program.
Fonlupt, Jean, Skoda, Alexandre
openaire +3 more sources
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
RNA folding using quantum computers.
PLoS Computational Biology, 2022 The 3-dimensional fold of an RNA molecule is largely determined by patterns of intramolecular hydrogen bonds between bases. Predicting the base pairing network from the sequence, also referred to as RNA secondary structure prediction or RNA folding, is a
Dillion M Fox +4 more
doaj +1 more source
Scheduling a Single Machine with Primary and Secondary Objectives
Algorithms, 2018 We study a scheduling problem in which jobs with release times and due dates are to be processed on a single machine. With the primary objective to minimize the maximum job lateness, the problem is strongly NP-hard.
Nodari Vakhania
doaj +1 more source
Chip, 2023 This paper demonstrated the fabrication, characterization, data-driven modeling, and practical application of a 1D SnO2 nanofiber-based memristor, in which a 1D SnO2 active layer was sandwiched between silver (Ag) and aluminum (Al) electrodes.
Soumi Saha +8 more
doaj +1 more source
Informatics in Medicine Unlocked, 2021 Objective: Contemporary predictive models of mortality for adult critically ill patients are not suitable for use at the bedside. Almost all have been developed and then tested using retrospective, cleansed data, which does not give an accurate ...
Andrew A. Kramer
doaj +1 more source