Greedy-type resistance of combinatorial problems
From MaRDI portal
Publication:865746
DOI10.1016/J.DISOPT.2006.03.001zbMATH Open1112.90065OpenAlexW2077940370MaRDI QIDQ865746FDOQ865746
Authors: Gareth Bendall, François Margot 
Publication date: 20 February 2007
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.03.001
Recommendations
- Some results on greedy algorithm conjectures
- Greedy algorithms and poset matroids
- Greedy sets and related problems
- Greedy algorithm compatibility and heavy-set structures
- The complexity of the matroid-greedoid partition problem
- Problems on independence systems solvable by the greedy algorithm
- The greedy algorithm and Coxeter matroids
- scientific article; zbMATH DE number 1875441
- scientific article; zbMATH DE number 2044949
- Greedy in Approximation Algorithms
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- When the greedy algorithm fails
- Domination analysis of combinatorial optimization problems.
- TSP heuristics: domination analysis and complexity
- Anti-matroids
Cited In (2)
This page was built for publication: Greedy-type resistance of combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865746)
