\(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids

DOI10.1006/aama.1998.0638zbMath1016.90036OpenAlexW2034567727MaRDI QIDQ1293131

Walter Wenzel, Ingo Althöfer

Publication date: 28 June 1999

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1998.0638

zbMATH Keywords

greedy algorithmvaluated matroidsdiscrete optimizationdistance constraints\(k\)-best algorithmsconvexity in graphsvaluated \(\Delta\)-matroids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity and Steinitz's exchange property
• Valuated matroids: A new look at the greedy algorithm
• Matchings and \(\Delta\)-matroids
• A greedy-algorithm characterization of valuated \(\Delta\)-matroids
• Valuated matroids
• Penny-packing and two-dimensional codes
• Discrete convex analysis
• Two-best solutions under distance constraints: The model and exemplary results for matroids
• \(\Delta\)-matroids with the strong exchange conditions
• Finding the \(k\) shortest paths in parallel
• Finding optimal minors of valuated bimatroids
• Minimal-energy clusters of hard spheres
• Maurer's homotopy theory and geometric algebra for even \(\Delta\)-matroids
• Matchings and \(\Delta\)-matroids with coefficients
• A Method for the Solution of the N th Best Path Problem
• Greedy algorithm and symmetric matroids
• Finding the k Shortest Paths

This page was built for publication: \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids