Výsledky vyhledávání - "combinatorial algorithm"
-
1
Combinatorial Algorithm for Reliability Analysis of Multistate Systems With Propagated Failures and Failure Isolation Effect
ISSN: 1083-4427, 1558-2426Vydáno: IEEE 01.11.2011Vydáno v IEEE transactions on systems, man and cybernetics. Part A, Systems and humans (01.11.2011)“…This paper considers the reliability analysis of multistate systems (MSSs) subject to propagated failure with global effect (PFGE…”
Získat plný text
Journal Article -
2
Progressive combinatorial algorithm for multiple structural alignments: Application to distantly related proteins
ISSN: 0887-3585, 1097-0134, 1097-0134Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2004Vydáno v Proteins, structure, function, and bioinformatics (01.05.2004)“… These alignments are progressively expanded to include additional proteins and more spatially equivalent residues, subject to certain criteria…”
Získat plný text
Journal Article -
3
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
ISBN: 1467343838, 9781467343831ISSN: 0272-5428Vydáno: IEEE 01.10.2012Vydáno v 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (01.10.2012)“…We present an optimal, combinatorial 1-1/e approximation algorithm for monotone sub modular optimization over a matroid constraint. Compared to the continuous…”
Získat plný text
Konferenční příspěvek -
4
Co-density and fractional edge cover packing
ISSN: 1382-6905, 1573-2886Vydáno: New York Springer US 01.05.2020Vydáno v Journal of combinatorial optimization (01.05.2020)“…), which can be formulated as the following linear program Maximize 1 T x subject to A x ≤ w x ≥ 0 , where A is…”
Získat plný text
Journal Article -
5
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 19.11.2013Vydáno v arXiv.org (19.11.2013)“…We present an optimal, combinatorial 1-1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous…”
Získat plný text
Paper -
6
Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity
ISSN: 0304-3975Vydáno: Elsevier B.V 18.01.2026Vydáno v Theoretical computer science (18.01.2026)“… In this work, we obtain the first constant factor approximation algorithm for non-monotone submodular maximization subject to a knapsack constraint with near-optimal O(log n…”
Získat plný text
Journal Article -
7
Submodular function minimization and related topics
ISSN: 1055-6788, 1029-4937Vydáno: Taylor & Francis Group 01.04.2003Vydáno v Optimization methods & software (01.04.2003)“… The present article is basically a survey, though not comprehensive, on submodular function minimization algorithms and also describes additional results and research subjects…”
Získat plný text
Journal Article -
8
Functional Dependence
ISBN: 1119507634, 9781119507635Vydáno: United Kingdom Wiley 2019Vydáno v Dynamic System Reliability (2019)“… The combinatorial algorithm can handle various complicated cases including cascading FDEPs, combined trigger events, shared dependent events, and dual‐role events…”
Získat plný text
Kapitola -
9
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer-Verlag 01.03.2010Vydáno v Mathematical programming (01.03.2010)“…Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications. Recently Fujishige and Iwata showed…”
Získat plný text
Journal Article -
10
Combinatorial Algorithms for the Unsplittable Flow Problem
ISSN: 0178-4617, 1432-0541Vydáno: New York, NY Springer 01.01.2006Vydáno v Algorithmica (01.01.2006)Získat plný text
Journal Article -
11
Compact linearization for binary quadratic problems subject to assignment constraints
ISSN: 1619-4500, 1614-2411Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2018Vydáno v 4OR (01.09.2018)“… Finally, we give a polynomial-time combinatorial algorithm that is exact in this case and can be used as a heuristic otherwise…”
Získat plný text
Journal Article -
12
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 20.10.2023Vydáno v arXiv.org (20.10.2023)“… In this work we obtain the first constant factor approximation algorithm for non-monotone submodular maximization subject to a knapsack constraint with near-optimal \(O(\log n…”
Získat plný text
Paper -
13
Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint
ISSN: 2194-668X, 2194-6698Vydáno: 23.09.2024Vydáno v Journal of the Operations Research Society of China (Internet) (23.09.2024)Získat plný text
Journal Article -
14
Combinatorial Algorithms for the Unsplittable FlowProblem
ISSN: 0178-4617, 1432-0541Vydáno: New York Springer Nature B.V 01.01.2006Vydáno v Algorithmica (01.01.2006)“…We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results…”
Získat plný text
Journal Article -
15
Scalable Combinatorial Tools for Health Disparities Research
ISSN: 1660-4601, 1661-7827, 1660-4601Vydáno: Switzerland MDPI AG 10.10.2014Vydáno v International journal of environmental research and public health (10.10.2014)“…Despite staggering investments made in unraveling the human genome, current estimates suggest that as much as 90% of the variance in cancer and chronic…”
Získat plný text
Journal Article -
16
Fair Matchings and Related Problems
ISSN: 0178-4617, 1432-0541, 1432-0541Vydáno: New York Springer US 01.03.2016Vydáno v Algorithmica (01.03.2016)“… We show an efficient combinatorial algorithm based on LP duality to compute a fair matching in G . We also show a scaling based algorithm for the fair b-matching problem…”
Získat plný text
Journal Article -
17
Maximum Entropy Summary Trees
ISSN: 0167-7055, 1467-8659Vydáno: Oxford, UK Blackwell Publishing Ltd 01.06.2013Vydáno v Computer graphics forum (01.06.2013)“… that results from aggregating nodes of the original tree subject to certain constraints. We suggest that the best choice of which summary tree to use…”
Získat plný text
Journal Article -
18
Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems
ISSN: 0303-6812, 1432-1416, 1432-1416Vydáno: Berlin/Heidelberg Springer-Verlag 01.01.2012Vydáno v Journal of mathematical biology (01.01.2012)“…) problem is to select, subject to budgetary constraints, a set of regions to conserve so that the phylogenetic diversity (PD…”
Získat plný text
Journal Article -
19
Inverse 1-center location problems with edge length augmentation on trees
ISSN: 0010-485X, 1436-5057Vydáno: Vienna Springer Vienna 01.11.2009Vydáno v Computing (01.11.2009)“… Using a set of suitably extended AVL-search trees we develop a combinatorial algorithm which solves the inverse 1-center location problem with edge length augmentation in O ( n log n ) time…”
Získat plný text
Journal Article -
20
New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application
ISSN: 2662-2556, 2662-2556Vydáno: Cham Springer International Publishing 01.12.2023Vydáno v Operations Research Forum (01.12.2023)“…Adapting to the consequences of climate change is one of the central challenges faced by humanity in the next decades. One of these consequences are intense…”
Získat plný text
Journal Article

