𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some undecidable problems on approximability of NP optimization problems

✍ Scribed by Xiong Huang

Book ID
112947495
Publisher
Springer
Year
1996
Tongue
English
Weight
362 KB
Volume
11
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On approximability of linear ordering an
On approximability of linear ordering and related NP-optimization problems on graphs
✍ Sounaka Mishra; Kripasindhu Sikdar πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 337 KB

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

On the approximability of some maximum s
On the approximability of some maximum spanning tree problems
✍ Giulia Galbiati; Angelo Morzenti; Francesco Maffioli πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 844 KB

We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the