Search Results - "Strongly Polynomial Time Algorithms"

  • Showing 1 - 8 results of 8
Refine Results
  1. 1
    Cover Image

    The subdivision-constrained minimum spanning tree problem by Li, Jianping, Li, Weidong, Zhang, Tongquan, Zhang, Zhongxu

    ISSN: 0304-3975, 1879-2294
    Published: Oxford Elsevier B.V 01.03.2009
    Published in Theoretical computer science (01.03.2009)
    “…Motivated by the constrained minimum spanning tree (CST) problem in Hassin and Levin [R. Hassin, A. Levin, An efficient polynomial time approximation scheme…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity by Boysen, Nils, Bock, Stefan, Fliedner, Malte

    ISSN: 1094-6136, 1099-1425
    Published: Boston Springer US 01.04.2013
    Published in Journal of scheduling (01.04.2013)
    “… For more restricted problem versions strongly polynomial time algorithms are presented. In contrast to this, NP-hardness in the strong sense is proven for more general problem versions. Moreover, for the most general version, even finding a feasible solution is shown to be strongly NP-hard…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    Matroid bases with cardinality constraints on the intersection by Lendl, Stefan, Peis, Britta, Timmermans, Veerle

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022
    Published in Mathematical programming (01.07.2022)
    “… polynomial-time algorithm was left as an open question in Hradovich et al. (J Comb Optim 34(2):554–573, 2017). We show that the two problems with lower and upper…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

    Exact Algorithms for Delay-Bounded Steiner Arborescences by Held, Stephan, Rockel, Benjamin

    Published: IEEE 01.06.2018
    “… polynomial time algorithm for this subproblem.We use the minimum cost flow formulation to quickly compute lower bounds in a branch…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  5. 5
    Cover Image

    Packing Odd Walks and Trails in Multiterminal Networks by Akhmedov, Maxim, Babenko, Maxim

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 01.03.2023
    Published in arXiv.org (01.03.2023)
    “… \(T\)-walks subject to capacities \(cap\). First, we present a strongly polynomial time algorithm for constructing a maximum fractional packing of odd \(T\)-walks…”
    Get full text
    Paper
    Save to List
    Saved in:
  6. 6
    Cover Image

    Energy-efficient capacity-constrained routing in wireless sensor networks by Patel, Maulin, Venkateson, S, Chandrasekaran, R

    ISSN: 1742-7371, 1742-738X
    Published: Bingley Emerald Group Publishing Limited 01.01.2006
    “…A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  7. 7
    Cover Image

    Matroid Bases with Cardinality Constraints on the Intersection by Lendl, Stefan, Peis, Britta, Timmermans, Veerle

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 06.12.2019
    Published in arXiv.org (06.12.2019)
    “… polynomial-time algorithm…”
    Get full text
    Paper
    Save to List
    Saved in:
  8. 8
    Cover Image

    Competitive Equilibria in Matching Markets with Budgets by Chen, Ning, Deng, Xiaotie, Ghosh, Arpita

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 16.04.2010
    Published in arXiv.org (16.04.2010)
    “…We study competitive equilibria in the classic Shapley-Shubik assignment model with indivisible goods and unit-demand buyers, with budget constraints: buyers…”
    Get full text
    Paper
    Save to List
    Saved in:

Search Tools: