A problem reduction based approach to discrete optimization algorithm design
From MaRDI portal
Publication:975314
DOI10.1007/s00607-010-0085-0zbMath1192.68437OpenAlexW2042738557MaRDI QIDQ975314
Publication date: 9 June 2010
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0085-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple greedy algorithm for a class of shuttle transportation problems
- A new polynomial-time algorithm for linear programming
- An exercise in transformational programming: Backtracking and Branch-and- Bound
- Polynomial time approximation schemes and parameterized complexity
- Algorithm theories and design tactics
- A general model for matroids and the greedy algorithm
- Framework of algorithm correctness in NDADAS
- A new fully polynomial time approximation scheme for the Knapsack problem
- Dynamic programming revisited: Improving knapsack algorithms
- Vertex Cover: Further Observations and Further Improvements
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Nondeterminism within $P^ * $
- Approximate Local Search in Combinatorial Optimization
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Toward an Automatic Approach to Greedy Algorithms
This page was built for publication: A problem reduction based approach to discrete optimization algorithm design
