Hochschulschrift
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783896756886
3896756885
- Dimensions
-
21 cm
- Extent
-
XXIV, 211 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Zugl.: München, Techn. Univ., Diss., 1999
- Keyword
-
Durchstrahlungselektronenspektroskopie
Diskrete Tomografie
Packung
Überdeckung
Polytop
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:59 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Vries, Sven de
- Utz, Wiss.
Time of origin
- 1999
Other Objects (12)
Aspects of set packing, partitioning, and covering
Computational approaches to lattice packing and covering problems
Covering properties of lattice polytopes
Discrete stochastic geometry : beta-polytopes, random cones and empty simplices
Uncertainty in Discrete Optimization: Connectivity and Covering
Polytopes and Scheduling
Representation theory and polytopes
Representation theory and polytopes
Polytopes - combinatorics and computation
Non-flat regular polytopes and restrictions on chiral polytopes
Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects
Almost simple groups and polytopes
Aspects of set packing, partitioning, and covering
Computational approaches to lattice packing and covering problems
Covering properties of lattice polytopes
Discrete stochastic geometry : beta-polytopes, random cones and empty simplices
Uncertainty in Discrete Optimization: Connectivity and Covering
Polytopes and Scheduling
Representation theory and polytopes
Representation theory and polytopes
Polytopes - combinatorics and computation
Non-flat regular polytopes and restrictions on chiral polytopes
Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects
Almost simple groups and polytopes
Aspects of set packing, partitioning, and covering
Computational approaches to lattice packing and covering problems
Covering properties of lattice polytopes
Discrete stochastic geometry : beta-polytopes, random cones and empty simplices
Uncertainty in Discrete Optimization: Connectivity and Covering
Polytopes and Scheduling
Representation theory and polytopes
Representation theory and polytopes
Polytopes - combinatorics and computation
Non-flat regular polytopes and restrictions on chiral polytopes
Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects