Výsledky vyhľadávania - "combinatorial algorithms"
-
1
Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity
ISSN: 0304-3975Vydavateľské údaje: Elsevier B.V 18.01.2026Vydané 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ískať plný text
Journal Article -
2
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
ISSN: 0025-5610, 1436-4646Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.03.2010Vydané 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ískať plný text
Journal Article -
3
Combinatorial Algorithms for the Unsplittable Flow Problem
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York, NY Springer 01.01.2006Vydané v Algorithmica (01.01.2006)Získať plný text
Journal Article -
4
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 20.10.2023Vydané 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ískať plný text
Paper -
5
Combinatorial Algorithms for the Unsplittable FlowProblem
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer Nature B.V 01.01.2006Vydané 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ískať plný text
Journal Article -
6
Scalable Combinatorial Tools for Health Disparities Research
ISSN: 1660-4601, 1661-7827, 1660-4601Vydavateľské údaje: Switzerland MDPI AG 10.10.2014Vydané 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ískať plný text
Journal Article -
7
Maximum Entropy Summary Trees
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.06.2013Vydané 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ískať plný text
Journal Article -
8
Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems
ISSN: 0303-6812, 1432-1416, 1432-1416Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.01.2012Vydané 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ískať plný text
Journal Article -
9
Nature Reserve Selection Problem: A Tight Approximation Algorithm
ISSN: 1545-5963, 1557-9964Vydavateľské údaje: United States IEEE 01.04.2008Vydané v IEEE/ACM transactions on computational biology and bioinformatics (01.04.2008)“… Subject to budgetary constraints, the problem is to select a set of regions to be conserved so that the phylogenetic diversity of the set of species contained within those regions is maximized…”
Získať plný text
Journal Article -
10
Bicriteria Network Design Problems
ISSN: 0196-6774, 1090-2678Vydavateľské údaje: San Diego, CA Elsevier Inc 01.07.1998Vydané v Journal of algorithms (01.07.1998)“…), with a budget specified on the first objective, find a subgraph from a given subgraph-class that minimizes the second objective subject to the budget on the first objective…”
Získať plný text
Journal Article -
11
Distributed placement of power generation resources in uncertain environments
ISBN: 9781450349659, 145034965XVydavateľské údaje: New York, NY, USA ACM 18.04.2017Vydané v 2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) (18.04.2017)“… The presented approach is applicable where a distribution of resources is required subject to challenges posed by uncertainty in the behavior of the environment…”
Získať plný text
Konferenčný príspevok.. -
12
Combinatorial Algorithm for Reliability Analysis of Multistate Systems With Propagated Failures and Failure Isolation Effect
ISSN: 1083-4427, 1558-2426Vydavateľské údaje: IEEE 01.11.2011Vydané 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ískať plný text
Journal Article -
13
Computer algebra and desuspensions of stunted real projective spaces
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1992Vydané v International journal of computer mathematics (01.01.1992)“…In this work we apply computer algebra methods to partially solve a geometric problem which arises in algebraic topology. This is related to a particularly…”
Získať plný text
Journal Article -
14
Reliability analysis of multi-trigger binary systems subject to competing failures
ISSN: 0951-8320, 1879-0836Vydavateľské údaje: Oxford Elsevier Ltd 01.03.2013Vydané v Reliability engineering & system safety (01.03.2013)“…This paper suggests two combinatorial algorithms for the reliability analysis of multi-trigger binary systems subject to competing failure propagation and failure isolation effects…”
Získať plný text
Journal Article -
15
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
ISBN: 1467343838, 9781467343831ISSN: 0272-5428Vydavateľské údaje: IEEE 01.10.2012Vydané 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ískať plný text
Konferenčný príspevok.. -
16
Progressive combinatorial algorithm for multiple structural alignments: Application to distantly related proteins
ISSN: 0887-3585, 1097-0134, 1097-0134Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2004Vydané 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ískať plný text
Journal Article -
17
K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning
ISSN: 0278-0070, 1937-4151Vydavateľské údaje: New York IEEE 01.04.2024Vydané v IEEE transactions on computer-aided design of integrated circuits and systems (01.04.2024)“… Multilevel partitioners are subject to two limitations: 1) hypergraph coarsening processes rely on local neighborhood structure without fully considering the global structure of the hypergraph and 2…”
Získať plný text
Journal Article -
18
Co-density and fractional edge cover packing
ISSN: 1382-6905, 1573-2886Vydavateľské údaje: New York Springer US 01.05.2020Vydané 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ískať plný text
Journal Article -
19
Analysis and assessment of weighted combinatorial criterion for test suite reduction
ISSN: 0748-8017, 1099-1638Vydavateľské údaje: Bognor Regis Wiley Subscription Services, Inc 01.02.2022Vydané v Quality and reliability engineering international (01.02.2022)“…Software plays an important role in modern society. New software features have to be completed and tested rapidly due to business and user needs and goals. To…”
Získať plný text
Journal Article -
20
Budget-constrained inverse median facility location problem on tree networks
ISSN: 0096-3003Vydavateľské údaje: Elsevier Inc 15.06.2020Vydané v Applied mathematics and computation (15.06.2020)“… under the perturbed vertex weights. We develop novel combinatorial algorithms for deriving the optimal solutions of the problem on tree networks under different cost norms…”
Získať plný text
Journal Article

