Rounding

 

 


 

Customize your search:

E.g., 2016-12-06
E.g., 2016-12-06
E.g., 2016-12-06
Dec 5th 2016

How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum.

Average: 6 (1 vote)