- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Report in Wirtschaftsmathematik (WIMA Report) ; 69
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Technische Universität Kaiserslautern, Fachbereich Mathematik
- (wann)
-
2000
- Urheber
-
Bruglieri, Maurizio
Ehrgott, Matthias
Hamacher, Horst W.
- URN
-
urn:nbn:de:hbz:386-kluedo-10788
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bruglieri, Maurizio
- Ehrgott, Matthias
- Hamacher, Horst W.
- Technische Universität Kaiserslautern, Fachbereich Mathematik
Entstanden
- 2000
Ähnliche Objekte (12)
Minimum Cut Tree Games
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Complexity results for some classes of strategic games
Minimum Fundamental Cut Basis Problem
The complexity of local max-cut
The complexity of local Max-Cut
Minimum Cut Bases in Undirected Networks
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
New heuristics for the minimum fundamental cut basis problem
Complexity results for confluence problems
Save some, lose some: Biological consequences of an unexpected wage cut
Rounding probabilities: maximum probabiltiy and minimum complexity multipliers
Minimum Cut Tree Games
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Complexity results for some classes of strategic games
Minimum Fundamental Cut Basis Problem
The complexity of local max-cut
The complexity of local Max-Cut
Minimum Cut Bases in Undirected Networks
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
New heuristics for the minimum fundamental cut basis problem
Complexity results for confluence problems
Save some, lose some: Biological consequences of an unexpected wage cut
Rounding probabilities: maximum probabiltiy and minimum complexity multipliers
Minimum Cut Tree Games
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Complexity results for some classes of strategic games
Minimum Fundamental Cut Basis Problem
The complexity of local max-cut
The complexity of local Max-Cut
Minimum Cut Bases in Undirected Networks
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
New heuristics for the minimum fundamental cut basis problem
Complexity results for confluence problems
Save some, lose some: Biological consequences of an unexpected wage cut