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 calle
β¦ LIBER β¦
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
β Scribed by Sounaka Mishra; Kripasindhu Sikdar
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 297 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On approximability of linear ordering an
β
Sounaka Mishra; Kripasindhu Sikdar
π
Article
π
2004
π
Elsevier Science
π
English
β 337 KB
On Extensions, Linear Extensions, Upsets
β
Ricardo C. CorrΓ’a; Jayme L. Szwarcfiter
π
Article
π
2000
π
Elsevier Science
π
English
β 269 KB
On the duality of a non-convex optimizat
β
Thomas Fischer
π
Article
π
1992
π
Elsevier Science
π
English
β 465 KB
Two new algorithms for solving optimizat
β
Ali Abbasi Molai
π
Article
π
2010
π
Elsevier Science
π
English
β 877 KB
This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio
On the relation between order of accurac
β
D. Holdaway; J. Thuburn; N. Wood
π
Article
π
2008
π
John Wiley and Sons
π
English
β 163 KB
π 2 views