The DIMACS Implementation Challenges address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails. Experimentation also brings algorithmic questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data structures. It provides an opportunity to develop and test problem instances, instance generators, and other methods of testing and comparing performance of algorithms. And it is a step in technology transfer by providing leading edge implementations of algorithms for others to adapt. The information on challenges includes pointers to WWW/FTP sites that include calls for participation, algorithm implementations, instance generators, bibliographies, and other electronic artifacts. The challenge organizers are also producing refereed volumes in the AMS-DIMACS book series; these contain selected papers from the workshops that culminate each challenge. If you are using the implementations, generators or other files, please take a few minutes to tell us how you are using it, what applications you are working on, and how it impacts your work. We need to document the impact of this research to the agencies and foundations that support it - your stories are essential to doing that. Send comments to: froberts@dimacs.rutgers.edu

References in zbMATH (referenced in 417 articles )

Showing results 1 to 20 of 417.
Sorted by year (citations)

1 2 3 ... 19 20 21 next

  1. Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (2018)
  2. Kokosiński, Zbigniew; Bała, Marcin: Solving graph partitioning problems with parallel metaheuristics (2018)
  3. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  4. Pandit, Parthe; Kulkarni, Ankur A.: A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (2018)
  5. Yezerska, Oleksandra; Butenko, Sergiy; Boginski, Vladimir L.: Detecting robust cliques in graphs subject to uncertain edge failures (2018)
  6. Abu-Khzam, Faisal N.; Cai, Shaowei; Egan, Judith; Shaw, Peter; Wang, Kai: Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis (2017)
  7. Al-Saedi, Balasim; Fourdrinoy, Olivier; Grégoire, Éric; Mazure, Bertrand; Saïs, Lakhdar: About some UP-based polynomial fragments of SAT (2017)
  8. Álvarez-Miranda, Eduardo; Farhan, Hesso; Luipersbeck, Martin; Sinnl, Markus: A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (2017)
  9. Balasubramaniam, Chitra; Butenko, Sergiy: On robust clusters of minimum cardinality in networks (2017)
  10. Belachew, Melisew Tefera; Gillis, Nicolas: Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (2017)
  11. Colombi, Marco; Mansini, Renata; Savelsbergh, Martin: The generalized independent set problem: polyhedral analysis and solution approaches (2017)
  12. Dumančić, Sebastijan; Blockeel, Hendrik: An expressive dissimilarity measure for relational clustering using neighbourhood trees (2017)
  13. Fischetti, Matteo; Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Monaci, Michele; Resch, Max; Salvagnin, Domenico; Sinnl, Markus: Thinning out Steiner trees: a node-based model for uniform edge costs (2017)
  14. Fotakis, Dimitris; Kaporis, Alexis C.; Lianeas, Thanasis; Spirakis, Paul G.: Resolving Braess’s paradox in random networks (2017)
  15. Fu, Zhang-Hua; Hao, Jin-Kao: Swap-vertex based neighborhood for Steiner tree problems (2017)
  16. Galán, Severino F.: Simple decentralized graph coloring (2017)
  17. Haus, Utz-Uwe; Michini, Carla: Compact representations of all members of an independence system (2017)
  18. Hougardy, Stefan; Silvanus, Jannik; Vygen, Jens: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (2017)
  19. Lamm, Sebastian; Sanders, Peter; Schulz, Christian; Strash, Darren; Werneck, Renato F.: Finding near-optimal independent sets at scale (2017)
  20. Li, Xiangyong; Aneja, Y. P.: Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (2017)

1 2 3 ... 19 20 21 next