Skip to content

Approximation algorithms are algorithms that find approximate solutions to optimization problems, usually with a guarantee of the solution's quality relative to the optimal solution. They are used when exact solutions are too time-consuming to compute. Approximation algorithms trade-off optimality for efficiency and are commonly used in scheduling.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/approximation-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Approximation Algorithms Android App

An open-source Android application that implements various approximation algorithms in Kotlin.

Features

  • User-friendly interface for inputting problem information
  • Implements algorithms for various optimization problems such as Vertex Cover, Set Cover, and Traveling Salesman
  • Option to compare the approximated solution with the optimal solution
  • Can be used by students, computer scientists, and mathematicians alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/ApproximationAlgorithms.git
  2. Open the project in Android Studio
  3. Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.

About

Approximation algorithms are algorithms that find approximate solutions to optimization problems, usually with a guarantee of the solution's quality relative to the optimal solution. They are used when exact solutions are too time-consuming to compute. Approximation algorithms trade-off optimality for efficiency and are commonly used in scheduling.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages