Titlebook: Generalized Network Improvement and Packing Problems; Michael Holzhauser Book 2016 Springer Fachmedien Wiesbaden GmbH 2016 Computational C

VIRAL

書目名稱Generalized Network Improvement and Packing Problems影響因子(影響力)




書目名稱Generalized Network Improvement and Packing Problems影響因子(影響力)學(xué)科排名




書目名稱Generalized Network Improvement and Packing Problems網(wǎng)絡(luò)公開度




書目名稱Generalized Network Improvement and Packing Problems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Generalized Network Improvement and Packing Problems被引頻次




書目名稱Generalized Network Improvement and Packing Problems被引頻次學(xué)科排名




書目名稱Generalized Network Improvement and Packing Problems年度引用




書目名稱Generalized Network Improvement and Packing Problems年度引用學(xué)科排名




書目名稱Generalized Network Improvement and Packing Problems讀者反饋




書目名稱Generalized Network Improvement and Packing Problems讀者反饋學(xué)科排名

RUPT

Disabled Children and Young People,ntify a polynomially solvable special case and show that the problem is solvable in pseudo-polynomial time when restricting to integral flows on series-parallel graphs..This chapter is based on joint work with Sven O. Krumke and Clemens Thielen (Holzhauser et al., 2015b).

archaeology

Convex Generalized Flows,ntify a polynomially solvable special case and show that the problem is solvable in pseudo-polynomial time when restricting to integral flows on series-parallel graphs..This chapter is based on joint work with Sven O. Krumke and Clemens Thielen (Holzhauser et al., 2015b).

愉快么

Book 2016 the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

綠州

Robert E. Hosmer (Lecturer in English)in FPTASs with varying time complexities for oracles with varying power. Finally, we show that this generalized packing framework, which will be used in Chapter 4 and 6, yields FPTASs for a large class of network flow problems in general.

ACRID

ACRID

Consciousness and Capacity-Building,lem becomes strongly .-hard to solve, but still solvable in pseudo-polynomial-time on series-parallel graphs and easy to approximate under several restrictions on extension-parallel graphs..This chapter is based on joint work with Sven O. Krumke and Clemens Thielen (Holzhauser et al., 2016a).

容易懂得

Torben J. Andersen,Richard A. Bettisorithms with strongly polynomial running time. Finally, we study the case of . flows and show that the problem becomes .-hard to solve and approximate in this case..This chapter is based on joint work with Sven O. Krumke and Clemens Thielen (Holzhauser et al., 2016c).

縮減了

Fractional Packing and Parametric Search Frameworks,in FPTASs with varying time complexities for oracles with varying power. Finally, we show that this generalized packing framework, which will be used in Chapter 4 and 6, yields FPTASs for a large class of network flow problems in general.

灌輸

Budget-Constrained Minimum Cost Flows: The Continuous Case,is the largest number that occurs in the problem instance. Moreover, we present a strongly polynomial-time algorithm that computes . traditional minimum cost flows and derive three fully polynomial-time approximation schemes for the problem on general and on acyclic graphs..This chapter is based on