𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof verification and the hardness of approximation problems

✍ Scribed by Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario

Book ID
121465343
Publisher
Association for Computing Machinery
Year
1998
Tongue
English
Weight
409 KB
Volume
45
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation hardness of edge dominatin
Approximation hardness of edge dominating set problems
✍ Miroslav ChlebΓ­k; Janka ChlebΓ­kovΓ‘ πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 324 KB

We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, MINIMUM EDGE DOMINATING SET and MINIMUM MAXIMAL MATCHING. We show that it is NP-hard to approximate the solution of both problems to within any constant factor