Narrow search
Showing 1 - 10 of 13
Cover Image
Characterizations of adjacency on the branching polyhedron
Giles, Rick; Hausmann, Dirk - 1978
Persistent link: https://www.econbiz.de/10000163507
Cover Image
Exponentielle untere Komplexitätsschranken für eine Klasse von Knapsack-Problemen
Korte, Bernhard; Kannan, Ravindran; Hausmann, Dirk - 1979
Persistent link: https://www.econbiz.de/10000163647
Cover Image
Algorithmic versus axiomatic definitions of matroids
Hausmann, Dirk; Korte, Bernhard - 1979
Persistent link: https://www.econbiz.de/10000164320
Cover Image
The relative strength of oracles for independence systems
Hausmann, Dirk; Korte, Bernhard - 1979
Persistent link: https://www.econbiz.de/10000164321
Cover Image
Adjacency on polytopes in combinatorial optimization
Hausmann, Dirk - 1980
Persistent link: https://www.econbiz.de/10000079958
Cover Image
Worst case analysis of greedy type algorithms for independence systems
Hausmann, Dirk; Jenkyns, T. A.; Korte, Bernhard - 1977
Persistent link: https://www.econbiz.de/10003274277
Cover Image
Exponential lower bounds on a class of knapsack algorithms
Hausmann, Dirk; Kannan, Ravindran; Korte, Bernhard - 1977
Persistent link: https://www.econbiz.de/10003123270
Cover Image
Adjacency on the branching polyhedron
Hausmann, Dirk - 1977
Persistent link: https://www.econbiz.de/10002742901
Cover Image
K-greedy algorithms for independence systems
Hausmann, Dirk; Korte, Bernhard - 1977
Persistent link: https://www.econbiz.de/10002742917
Cover Image
Lower bounds on the worst-case complexity of some oracle algorithms
Hausmann, Dirk; Korte, Bernhard - 1977
Persistent link: https://www.econbiz.de/10002742926