summaryrefslogtreecommitdiff
path: root/networkx/algorithms/approximation/__init__.py
Commit message (Expand)AuthorAgeFilesLines
* Delete warning in approximation documentation (#6221)Paula Pérez Bianchi2023-02-031-5/+5
* Add approximation algorithms for traveling salesman problem (#4607)Dan Schult2021-05-161-8/+9
* Approximated Diameter (#4476)Andrea Tomassilli2021-01-121-0/+1
* Cliques on mutigraph/directed graph types (#4502)Andrea Tomassilli2021-01-121-1/+0
* Maxcut heuristics (#4138)Jonas Charfreitag2020-12-141-0/+1
* Remove boiler plate from top of modulesJarrod Millman2019-11-111-8/+0
* PEP8 fixesJarrod Millman2019-10-181-1/+1
* Update copyrightJarrod Millman2019-03-301-1/+1
* Treewidth and tree decomposition heuristics (#2935) (#2951)David Kraeutmann2018-06-261-0/+1
* Add a large clique size heuristic function (#2830)Dan Schult2018-01-171-5/+19
* Add docs for steiner_tree and metric_closure (#2783)Dan Schult2017-12-021-0/+1
* Merge remote-tracking branch 'upstream/master' into fix_approximation_importJGab2015-06-111-0/+1
|\
| * Add fast approximation for k-(node)-components.Jordi Torrents2015-06-031-0/+1
* | Document approximationJGab2015-05-101-0/+5
|/
* Add fast approximation for node connectivity.Jordi Torrents2015-03-141-0/+1
* Fixed init to include my new function.Fred Morstatter2013-05-091-0/+1
* Add independent set.Aric Hagberg2012-04-151-0/+1
* Add matching.Aric Hagberg2012-04-151-0/+1
* Add dominating set problem.Aric Hagberg2012-04-151-0/+1
* Add clique and ramsey.Aric Hagberg2012-04-151-0/+2
* Add vertex cover approximation algorithm.Aric Hagberg2012-04-151-0/+1