On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract)

MaRDI QIDQ2816031zbMATH OpenFDO

Authors Sounaka Mishra, Kripasindhu Sikdar

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800812?np=y

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On approximability of linear ordering and related NP-optimization problems on graphs.
• scientific article; zbMATH DE number 1759471
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 4047762

Cited in

(7)

• scientific article; zbMATH DE number 1757965 (Why is no real title available?)
• On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
• On approximability of linear ordering and related NP-optimization problems on graphs.
• scientific article; zbMATH DE number 1303559 (Why is no real title available?)
• scientific article; zbMATH DE number 1759471 (Why is no real title available?)
• Approximating Minimum Linear Ordering Problems
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem

This page was built for publication: On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816031)