Handbook of combinatorial optimization, 2. sējums
This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Computing the SubtreeTransfer Distance
The Rotation Distance
Combinatorial Optimization and Coalition Games
Resource Allocation Problems
Lower Bounds on Time Complexity and Improved Algorithms
Dynamical System Approaches
Online Dominating Set Problems for Graphs
Optimization Problems in Optical Networks
Shortest Networks on Surfaces
Minimum Weight Triangulations
Citi izdevumi - Skatīt visu
airline algorithm allocation applications approach approximation assignment assume bound called cluster coloring combinatorial combinatorial optimization complexity computing connected consider constraints construction contains convex core corresponding cost data structure defined denote developed Discrete discussed distance edge efficient equations example exists feasible Figure flight function geometric given graph heuristic holds integer Journal Lemma length linear Mathematics matrix method minimal moves nodes Note objective obstacles obtained operations optimal solution pair parallel partition path query performance planar plane points polygonal polynomial presented problem procedure proof prove ratio relation requires Research resource satisfies scheduling Science selection separable sequence short shortest path shown solution solved sorting space Steiner Steiner points Step subtree Table Theorem Theory transform tree triangulation variables vector vertex vertices weight