𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Power Algorithms for (max,+)- and Bipartite (min,max,+)-Systems

✍ Scribed by Subiono; Jacob van der Woude

Book ID
110261893
Publisher
Springer
Year
2000
Tongue
English
Weight
96 KB
Volume
10
Category
Article
ISSN
0924-6703

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Quasi-Min-Max MPC algorithms for LPV sys
Quasi-Min-Max MPC algorithms for LPV systems
✍ Yaohui Lu; Yaman Arkun πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 262 KB

A scheduling model predictive controller is presented for polytopic linear parameter varying systems with input and output constraints. It is shown that the receding horizon implementation of the feasible solutions guarantees closed-loop stability.

Approximation Algorithms for Min–Max Tre
Approximation Algorithms for Min–Max Tree Partition
✍ Nili Guttmann-Beck; Refael Hassin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 298 KB

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ε½ 2 . error ratio can be given for the problem unless P s NP.