Completeness in approximation classes
Information and Computation
A new lower bound via projection for the quadratic assignment problem
Mathematics of Operations Research
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics
A new heuristic algorithm solving the linear ordering problem
Computational Optimization and Applications
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
On weighted vs unweighted versions of combinatorial optimizationproblems
Information and Computation
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Optimizing Register Spills for Eager Functional Languages
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Structure in Approximation Classes (Extended Abstract)
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Learning linear ordering problems for better translation
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
Hi-index | 0.00 |
We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter called MIN-Subset-FAS/MIN-Subset-FVS. MAX-LOP and the other problems have been studied by many researchers but, though MINLOP arises in many practical contexts, it appears that it has not been studied before. In this paper, we first note that these minimization (respectively, maximization) problems are equivalent with respect to strict reduction and so have the same approximability properties. While MAX-LOP is APX-complete, MIN-LOP is only APX-hard. We conjecture that MIN-LOP is not in APX, unless P = NP. We obtain a result connecting extreme points of linear ordering polytope with approximability of MIN-LOP via LP-relaxation which seems to suggest that constant factor approximability of MIN-LOP may not be obtainable via this method. We also prove that (a) MIN-Subset-FAS cannot be approximated within a factor (1 - ε) log n, for any ε 0, unless NP ⊂ DTIME(n log log n), and (b) MIN-W-k-FAS, a generalization of MIN-LOP, is NPO-complete. We then show that Δt-MIN-LOP (respectively, Δt-MAX-LOP), in which the weight matrix satisfies a parametrized version of a stronger form of triangle inequality, with parameter t ∈ (0,2], is approximable within a factor (2 + t)/2t (respectively, 4/(2 + t)). We also show that these restricted versions are in PO iff t = 2 and are not in PTAS for t ∈ (0, 2), unless P = NP.