Výsledky vyhledávání - "combinatorial algorithm"

  1. 1

    Combinatorial Algorithm for Reliability Analysis of Multistate Systems With Propagated Failures and Failure Isolation Effect Autor Liudong Xing, Levitin, G.

    ISSN: 1083-4427, 1558-2426
    Vydáno: IEEE 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. 2

    Progressive combinatorial algorithm for multiple structural alignments: Application to distantly related proteins Autor Ochagavía, María Elena, Wodak, Shoshana

    ISSN: 0887-3585, 1097-0134, 1097-0134
    Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 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. 3

    A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Autor Filmus, Y., Ward, J.

    ISBN: 1467343838, 9781467343831
    ISSN: 0272-5428
    Vydáno: IEEE 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. 4

    Co-density and fractional edge cover packing Autor Zhao, Qiulan, Chen, Zhibin, Sang, Jiajun

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.05.2020
    Vydá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. 5

    A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Autor Filmus, Yuval, Ward, Justin

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 19.11.2013
    Vydá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. 6

    Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity Autor Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Reiffenhäuser, Rebecca

    ISSN: 0304-3975
    Vydáno: Elsevier B.V 18.01.2026
    Vydá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. 7

    Submodular function minimization and related topics Autor Fujishige, Satoru

    ISSN: 1055-6788, 1029-4937
    Vydáno: Taylor & Francis Group 01.04.2003
    Vydá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. 8

    Functional Dependence Autor Xing, Liudong, Levitin, Gregory, Wang, Chaonan

    ISBN: 1119507634, 9781119507635
    Vydáno: United Kingdom Wiley 2019
    Vydá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. 9

    Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization Autor McCormick, S. Thomas, Fujishige, Satoru

    ISSN: 0025-5610, 1436-4646
    Vydáno: Berlin/Heidelberg Springer-Verlag 01.03.2010
    Vydá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. 10

    Combinatorial Algorithms for the Unsplittable Flow Problem Autor Azar, Yossi, Regev, Oded

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York, NY Springer 01.01.2006
    Vydáno v Algorithmica (01.01.2006)
    Získat plný text
    Journal Article
  11. 11

    Compact linearization for binary quadratic problems subject to assignment constraints Autor Mallach, Sven

    ISSN: 1619-4500, 1614-2411
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2018
    Vydá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. 12

    Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity Autor Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Alberto Marchetti Spaccamela, Reiffenhäuser, Rebecca

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 20.10.2023
    Vydá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. 13
  14. 14

    Combinatorial Algorithms for the Unsplittable FlowProblem Autor Azar Yossi, Regev Oded

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer Nature B.V 01.01.2006
    Vydá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. 15

    Scalable Combinatorial Tools for Health Disparities Research Autor Langston, Michael, Levine, Robert, Kilbourne, Barbara, Rogers, Gary, Kershenbaum, Anne, Baktash, Suzanne, Coughlin, Steven, Saxton, Arnold, Agboto, Vincent, Hood, Darryl, Litchveld, Maureen, Oyana, Tonny, Matthews-Juarez, Patricia, Juarez, Paul

    ISSN: 1660-4601, 1661-7827, 1660-4601
    Vydáno: Switzerland MDPI AG 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. 16

    Fair Matchings and Related Problems Autor Huang, Chien-Chung, Kavitha, Telikepalli, Mehlhorn, Kurt, Michail, Dimitrios

    ISSN: 0178-4617, 1432-0541, 1432-0541
    Vydáno: New York Springer US 01.03.2016
    Vydá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. 17

    Maximum Entropy Summary Trees Autor Karloff, Howard, Shirley, Kenneth E.

    ISSN: 0167-7055, 1467-8659
    Vydáno: Oxford, UK Blackwell Publishing Ltd 01.06.2013
    Vydá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. 18

    Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems Autor Bordewich, Magnus, Semple, Charles

    ISSN: 0303-6812, 1432-1416, 1432-1416
    Vydáno: Berlin/Heidelberg Springer-Verlag 01.01.2012
    Vydá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. 19

    Inverse 1-center location problems with edge length augmentation on trees Autor Alizadeh, Behrooz, Burkard, Rainer E., Pferschy, Ulrich

    ISSN: 0010-485X, 1436-5057
    Vydáno: Vienna Springer Vienna 01.11.2009
    Vydá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. 20

    New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application Autor Boeckmann, Jan, Thielen, Clemens

    ISSN: 2662-2556, 2662-2556
    Vydáno: Cham Springer International Publishing 01.12.2023
    Vydá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