default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Cliques, Coloring, and Satisfiability 1993
- David S. Johnson, Michael A. Trick:
Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, DIMACS/AMS 1996, ISBN 978-0-8218-6609-2 - David S. Johnson, Michael A. Trick:
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. 1-7
Clique
- Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki:
Polyhedral methods for the maximum clique problem. 11-28 - Egon Balas, William Niehaus:
Finding large cliques in arbitrary graphs by bipartite matching. 29-51 - Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure:
An exact quadratic 0-1 algorithm for the stable set problem. 53-73 - Mark Brockington, Joseph C. Culberson:
Camouflaging independent sets in quasi-random graphs. 75-88 - Mark K. Goldberg, Reid D. Rivenburgh:
Constructing cliques using restricted backtracking. 89-101 - Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos:
A continuous based heuristic for the maximum clique problem. 103-124 - Tal Grossman:
Applying the INN model to the Maximum Clique problem. 125-145 - Steven Homer, Marcus Peinado:
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. 147-167 - Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan:
Approximately solving Maximum Clique using neural network and related heuristics. 169-204 - Carlo Mannino, Antonio Sassano:
Edge projection and the maximum cardinality stable set problem. 205-219 - Patrick Soriano, Michel Gendreau:
Tabu search algorithms for the maximum clique problem. 221-242
Coloring
- Joseph C. Culberson, Feng Luo:
Exploring the k-colorable landscape with Iterated Greedy. 245-284 - Fred W. Glover, Mark Parker, Jennifer Ryan:
Coloring by tabu branch and bound. 285-307 - Gary Lewandowski, Anne Condon:
Experiments with parallel graph coloring heuristics and applications of graph coloring. 309-334 - Craig A. Morgenstern:
Distributed coloration neighborhood search. 335-357 - Edward C. Sewell:
An improved algorithm for exact graph coloring. 359-373
Satisfiability
- Yuichi Asahiro, Kazuo Iwama, Eiji Miyano:
Random generation of test instances with controlled attributes. 377-393 - Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang:
A linear programming and rounding approach to max 2-sat. 395-413 - Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier:
SAT versus UNSAT. 415-436 - Steven E. Hampson, Dennis F. Kibler:
Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again. 437-455 - Brigitte Jaumard, Mihnea Stan, Jacques Desrosiers:
Tabu search and a quadratic relaxation for the Satisfiability problem. 457-477 - Daniele Pretolani:
Efficiency and stability of hypergraph SAT algorithms. 479-498 - Mauricio G. C. Resende, Thomas A. Feo:
A GRASP for satisfiability. 499-520 - Bart Selman, Henry A. Kautz, Bram Cohen:
Local search strategies for satisfiability testing. 521-531 - William M. Spears:
Simulated annealing for hard satisfiability problems. 533-557 - Allen Van Gelder, Yumi K. Tsuji:
Satisfiability testing with more reasoning and less guessing. 559-586 - Richard J. Wallace, Eugene C. Freuder:
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. 587-615
Combination
- Charles Fleurent, Jacques A. Ferland:
Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability. 619-652 - Michael A. Trick:
Appendix: Second DIMACS Challenge test problems. 653-657
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
