% This file was created with JabRef 2.7.
% Encoding: Cp1252
@BOOK{GLS88,
title = {Geometric algorithms and combinatorial optimization},
publisher = {Springer-Verlag},
year = {1988},
author = {Martin Gr{\"o}tschel and L{\'a}szl{\'o} Lov{\'a}sz and Alexander
Schrijver},
pages = {xii+362},
address = {Berlin}
}
@BOOK{Schrijver-book,
title = {Combinatorial optimization. {P}olyhedra and efficiency.},
publisher = {Springer-Verlag},
year = {2003},
author = {Schrijver, Alexander},
volume = {24},
pages = {xxxviii+1881},
series = {Algorithms and Combinatorics},
address = {Berlin},
isbn = {3-540-44389-4},
mrclass = {90-02 (05-02 52B55 68Q25 68R10 90C27 90C35 90C57)},
mrnumber = {MR1956924 (2004b:90004a)},
mrreviewer = {Alexander I. Barvinok}
}
@BOOK{Schrijver-book-A,
title = {Combinatorial optimization. {P}olyhedra and efficiency. {V}ol. {A}},
publisher = {Springer-Verlag},
year = {2003},
author = {Schrijver, Alexander},
volume = {24},
pages = {xxxviii+647},
series = {Algorithms and Combinatorics},
address = {Berlin},
note = {Paths, flows, matchings, Chapters 1--38},
isbn = {3-540-44389-4},
mrclass = {90-02 (05-02 52B55 68Q25 68R10 90C27 90C35 90C57)},
mrnumber = {MR1956924 (2004b:90004a)},
mrreviewer = {Alexander I. Barvinok}
}
@BOOK{Schrijver-book-B,
title = {Combinatorial optimization. {P}olyhedra and efficiency. {V}ol. {B}},
publisher = {Springer-Verlag},
year = {2003},
author = {Schrijver, Alexander},
volume = {24},
pages = {i--xxxiv and 649--1217},
series = {Algorithms and Combinatorics},
address = {Berlin},
note = {Matroids, trees, stable sets, Chapters 39--69},
isbn = {3-540-44389-4},
mrclass = {90-02 (05-02 52B55 68Q25 68R10 90C27 90C35 90C57)},
mrnumber = {MR1956925 (2004b:90004b)},
mrreviewer = {Alexander I. Barvinok}
}
@BOOK{Schrijver-book-C,
title = {Combinatorial optimization. {P}olyhedra and efficiency. {V}ol. {C}},
publisher = {Springer-Verlag},
year = {2003},
author = {Schrijver, Alexander},
volume = {24},
pages = {i--xxxiv and 1219--1881},
series = {Algorithms and Combinatorics},
address = {Berlin},
note = {Disjoint paths, hypergraphs, Chapters 70--83},
isbn = {3-540-44389-4},
mrclass = {90-02 (05-02 52B55 68Q25 68R10 90C27 90C35 90C57)},
mrnumber = {MR1956926 (2004b:90004c)},
mrreviewer = {Alexander I. Barvinok}
}
@BOOK{FW98,
title = {Online algorithms},
publisher = {Springer-Verlag},
year = {1998},
editor = {Fiat, Amos and Woeginger, Gerhard J.},
volume = {1442},
pages = {xviii+436},
series = {Lecture Notes in Computer Science},
address = {Berlin},
note = {The state of the art, Papers from the Workshop on the Competitive
Analysis of On-line Algorithms held in Schloss Dagstuhl, June 1996},
isbn = {3-540-64917-4},
mrclass = {68-02 (68-06 68Q25)},
mrnumber = {MR1673029 (99m:68003)},
mrreviewer = {Peter B. Gibbons}
}
@BOOK{Hochbaum96,
title = {Approximation Algorithms for NP Hard Problems},
publisher = {PWS publishing Co},
year = {1996},
editor = {Dorit Hochbaum}
}
@BOOK{LLRS85,
title = {The Traveling Salesman Problem},
publisher = {Wiley-Interscience series in discrete mathematics},
year = {1985},
editor = {E. L. Lawler and J. K. Lenstra and A. H. G. Rinnooy Kan and D . B.
Shmoys}
}