Skip to content

A greedy approximation implementation of NP-hard problem.

Notifications You must be signed in to change notification settings

M-Abishaik/k-centre

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Determine a optimal location for placing the server so that all the cities are served optimally.

About

A greedy approximation implementation of NP-hard problem.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages