Výsledky vyhledávání - "Strongly polynomial-time algorithms"

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

“…Motivated by the constrained minimum spanning tree (CST) problem in Hassin and Levin [R. Hassin, A. Levin, An efficient polynomial time approximation scheme…”
Získat plný text

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

“… 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…”
Získat plný text

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

“… 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…”
Získat plný text

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

“… polynomial time algorithm for this subproblem.We use the minimum cost flow formulation to quickly compute lower bounds in a branch…”
Získat plný text

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

“… \(T\)-walks subject to capacities \(cap\). First, we present a strongly polynomial time algorithm for constructing a maximum fractional packing of odd \(T\)-walks…”
Získat plný text

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

“…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…”
Získat plný text

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

“… polynomial-time algorithm…”
Získat plný text

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

“…We study competitive equilibria in the classic Shapley-Shubik assignment model with indivisible goods and unit-demand buyers, with budget constraints: buyers…”
Získat plný text