Differential approximation of NP-hard problems with equal size feasible solutions
From MaRDI portal
Publication:4457890
Recommendations
- scientific article; zbMATH DE number 2011863
- Differential approximation results for the traveling salesman and related problems
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- scientific article; zbMATH DE number 1839451
- Differential approximation for optimal satisfiability and related problems
Cites work
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3572042 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1953087 (Why is no real title available?)
- scientific article; zbMATH DE number 1754594 (Why is no real title available?)
- scientific article; zbMATH DE number 1839451 (Why is no real title available?)
- scientific article; zbMATH DE number 1865680 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 910870 (Why is no real title available?)
- A fundamental problem in vehicle routing
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- An approximation algorithm for maximum packing of 3-edge paths
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximate solution of NP optimization problems
- Approximating the weight of shallow Steiner trees
- Approximation Algorithms for Some Postman Problems
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for indefinite quadratic programming
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Completeness in approximation classes
- Designing reliable tree networks with two cable technologies
- Differential approximation algorithms for some combinatorial optimization problems
- Differential approximation results for the Steiner tree problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Finding k points with minimum diameter and related problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Multicommodity flow models for spanning trees with hop constraints
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- On the completeness of a generalized matching problem
- P-Complete Approximation Problems
- Spanning Trees—Short or Small
- Structure preserving reductions among convex optimization problems
- The maximum \(f\)-depth spanning tree problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- \(z\)-approximations
Cited in
(2)
This page was built for publication: Differential approximation of NP-hard problems with equal size feasible solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457890)
