Home › Categories › Technology› This

This.pdf

focs07.pdf

🔗 Source: theory.epfl.ch

📊 Size: 253 KB

📄 Pages: 9 pages

⬇️ Downloads: 87

Summary

Researchers prove that three NP-hard problems - Sparsest Cut, Optimal Linear Arrangement, and precedence constrained scheduling problem 1|prec| P wjCj - have no Polynomial Time Approximation Scheme (PTAS) unless NP-complete problems can be solved in randomized subexponential time. They also show that the scheduling problem is as hard to approximate as Vertex Cover when the fixed cost is subtracted from the objective function. The results are based on the Quasi-random PCP construction and provide evidence that the various 2-approximation algorithms for 1|prec| P wjCj might be tight.

Download File

Description

Researchers prove that three NP-hard problems - Sparsest Cut, Optimal Linear Arrangement, and precedence constrained scheduling problem 1|prec| P wjCj - have...

Technical Information

File Format: PDF
File Size: 253 KB
Pages: 9
Language: EN
Total Downloads: 87
Last Updated: 6 hours ago

Document Overview

This PDF document about this provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into this.