All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Macros Pages
File List
Here is a list of all documented files with brief descriptions:
[detail level 123456]
o-bin
|o*frequent-directions.cppFrequent_directions binnary
|\*lsh-regression.cppLsh_regression binnary
o-docs
|\*namespaces.hppDocumentation for namespaces
o-examples
|o-auctions
||o+fractional_winner_determination_in_MUCA
||o+winner_determination_in_MUCA
||o*demand_query_example.cpp
||o*gamma_oracle_example.cpp
||o*single_minded_example.cpp
||o*value_query_example.cpp
||\*xor_bids_example.cpp
|o-clustering
||o*k_means_clustering_engine_example.cpp
||o*k_means_clustering_engine_start_from_clusters_example.cpp
||\*k_means_clustering_example.cpp
|o-data_structures
||\*components_example.cpp
|o-distance_oracle
||\*distance_oracle_example.cpp
|o-dynamic
||o*knapsack_0_1_example.cpp
||o*knapsack_0_1_no_output_example.cpp
||o*knapsack_0_1_on_size_fptas_example.cpp
||o*knapsack_0_1_on_size_fptas_no_output_example.cpp
||o*knapsack_0_1_on_value_fptas_example.cpp
||o*knapsack_0_1_on_value_fptas_no_output_example.cpp
||o*knapsack_unbounded_example.cpp
||o*knapsack_unbounded_on_size_fptas_example.cpp
||\*knapsack_unbounded_on_value_fptas_example.cpp
|o-greedy
||o*budgeted_maximum_coverage_example.cpp
||o*k_center_euclidean_metric_example.cpp
||o*k_center_example.cpp
||o*k_cut_example.cpp
||o*knapsack_0_1_two_app_example.cpp
||o*knapsack_unbounded_two_app_example.cpp
||o*max_coverage_example.cpp
||o*scheduling_jobs_example.cpp
||o*scheduling_jobs_on_identical_parallel_machines_example.cpp
||o*scheduling_jobs_with_deadlines_on_a_single_machine_example.cpp
||o*set_cover_example.cpp
||o*shortest_superstring_example.cpp
||\*steiner_tree_greedy_example.cppThis is example for greedy solution for steiner tree problem
|o-iterative_rounding
||o*bounded_degree_mst_example.cpp
||o*generalised_assignment_example.cpp
||o*iterative_rounding_example.cppIterative rounding example This is an example implementation of an algorithm within the Iterative Rounding framework. The implemented algorithm is a vertex cover 2-approximation
||o*steiner_network_example.cpp
||o*steiner_tree_ir_example.cpp
||\*tree_augmentation_example.cpp
|o-linear_programming
||o+multiway_cut
||\*lp_example.cpp
|o-local_search
||o*2_local_search_example.cpp2-opt example
||o*capacitated_facility_location_example.cpp
||o*facility_location_example.cpp
||o*k_median_example.cpp
||o*local_search_example.cppLocal search example
||o*local_search_lambda_example.cppLocal search example
||o*local_search_lambda_sa_tabu_example.cppLocal search example
||\*n_queens_example.cpp
|o-miscellaneous
||o*dreyfus_wagner_example.cpp
||\*zelikovsky_11_per_6_example.cppThis is example for zelikovsky 11/6 approximation for steiner tree problem
|o-regression
||o*lsh_nearest_neighbors_regression_efficient_example.cpp
||\*lsh_nearest_neighbors_regression_example.cpp
|o-sketch
||\*frequent_directions_example.cpp
|\-utility
| o*functors_example.cpp
| \*fusion_algorithms_example.cpp
\-include
 \-paal
  o+auctions
  o+clustering
  o+data_structures
  o+distance_oracle
  o+dynamic
  o+greedy
  o+iterative_rounding
  o+local_search
  o+lp
  o+multiway_cut
  o+regression
  o+sketch
  o+steiner_tree
  \+utils
Generated on Tue Jan 31 2017 00:31:12 by   doxygen 1.8.5