Gems of Combinatorial Optimization and Graph Algorithms - researchr publication

researchr

You are not signed in
Sign in
Sign up

Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors, Gems of Combinatorial Optimization and Graph Algorithms. Springer, 2015. [doi]

Abstract is missing.

Shifting Segments to OptimalityStefan Felsner. 1-12 [doi]

Linear Structure of Graphs and the Knotting GraphEkkehard Köhler. 13-27 [doi]

Finding Longest Geometric ToursSándor P. Fekete. 29-36 [doi]

Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation MetricsMatthias Müller-Hannemann. 37-47 [doi]

Budgeted Matching via the Gasoline PuzzleGuido Schäfer. 49-57 [doi]

Motifs in NetworksKarsten Weihe. 59-68 [doi]

Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction HierarchiesBen Strasser, Dorothea Wagner. 69-82 [doi]

Shortest Path to Mechanism DesignRudolf Müller, Marc Uetz. 83-94 [doi]

Selfish Routing and Proportional Resource AllocationAndreas S. Schulz. 95-102 [doi]

Resource Buying GamesTobias Harks, Britta Peis. 103-111 [doi]

Linear, Exponential, but Nothing ElseMax Klimm. 113-123 [doi]

Convex Quadratic Programming in SchedulingMartin Skutella. 125-132 [doi]

Robustness and Approximation for Universal SequencingNicole Megow. 133-141 [doi]

A Short Note on Long Waiting ListsSebastian Stiller. 143-150 [doi]

runs on WebDSL