Back to results

ETH

Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity

dc:creator Mömke, Tobias

dc:date2009

Degree

thesis:*

Grantor dc:publisher: ETH
Year dc:date: 2009

Author and committee

dc:creator, dc:contributor.*

Author dc:creator: Mömke, Tobias
Contributors dc:contributor: Widmayer, Peter
Hromkovič, Juraj

Subjects

dc:subject × 3

STEINER SYSTEMS (COMBINATORICS); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; COMBINATORIAL PROBLEMS (DISCRETE PROGRAMMING); STEINER-SYSTEME (KOMBINATORIK); KOMBINATORISCHE PROBLEME (DISKRETE OPTIMIERUNG); ALGORITHMIC COMPLEXITY (MATHEMATICS); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY)
info:eu-repo/classification/ddc/004
Data processing, computer science

Rights

dc:rights

Statement dc:rights: info:eu-repo/semantics/openAccess

In Copyright - Non-Commercial Use Permitted
Licence: http://rightsstatements.org/page/InC-NC/1.0/
Language dc:language: en

Identifiers

dc:identifier.*

Identifier: https://doi.org/10.3929/ethz-a-005981139
OAI record oai:identifier: https://www.research-collection.ethz.ch/oai/request?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Awww.research-collection.ethz.ch%3A20.500.11850%2F72745

Chain of custody

source

Harvested from: ETH Zürich
Base URL: www.research-collection.ethz.ch/oai/request
Last updated: 2026-07-27
Source record: OAI-PMH GetRecord

related terms

citation

Mömke, Tobias. Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity. ETH, 2009. http://hdl.handle.net/20.500.11850/72745

More from ETH Zürich