Handbook of combinatorial optimization, 2. sējums

Pirmais vāks
Dingzhu Du, Panos M. Pardalos
Springer Science & Business Media, 1998. gada 15. dec. - 2403 lappuses
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.

No grāmatas satura

Lietotāju komentāri - Rakstīt atsauksmi

Ierastajās vietās neesam atraduši nevienu atsauksmi.

Saturs

Contents
38
Computing the SubtreeTransfer Distance
53
The Rotation Distance
65
Combinatorial Optimization and Coalition Games
77
An Introduction
105
Resource Allocation Problems
159
Proximity Theorems
197
Lower Bounds on Time Complexity and Improved Algorithms
209
References
399
Applications
441
Dynamical System Approaches
471
1
476
Online Dominating Set Problems for Graphs
525
Optimization Problems in Optical Networks
543
Shortest Networks on Surfaces
589
Minimum Weight Triangulations
617

Introduction
225
Further Topics
239
Combinatoral Optimization in Clustering
261
A Bibliographic Survey
331
Steiner Minimal Trees in
397
Optimization Applications in the Airline Industry
635
Author Index
727
Subject Index
749
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Populāri fragmenti

1. lappuse - Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA, E-mail: {chen,odaescu}<Dcse.

Atsauces uz šo grāmatu

Bibliogrāfiskā informācija