Cliques, coloring, and satisfiability: second DIMACS Implementation Challenge, October 11-13, 1993
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Providence, RI
American Math. Soc.
1996
|
| Series: | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science
26 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XI, 657 S. graph. Darst. |
| ISBN: | 0821866095 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011137176 | ||
| 003 | DE-604 | ||
| 005 | 19971023 | ||
| 007 | t| | ||
| 008 | 970108s1996 xx d||| |||| 10||| eng d | ||
| 020 | |a 0821866095 |9 0-8218-6609-5 | ||
| 035 | |a (OCoLC)34191924 | ||
| 035 | |a (DE-599)BVBBV011137176 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-83 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 511/.5 |2 20 | |
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 245 | 1 | 0 | |a Cliques, coloring, and satisfiability |b second DIMACS Implementation Challenge, October 11-13, 1993 |c David S. Johnson ..., ed. |
| 264 | 1 | |a Providence, RI |b American Math. Soc. |c 1996 | |
| 300 | |a XI, 657 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 26 | |
| 650 | 7 | |a Algorithmes - Informatique |2 ram | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a clique |2 inriac | |
| 650 | 7 | |a coloration graphe |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a graphe |2 inriac | |
| 650 | 7 | |a hypergraphe |2 inriac | |
| 650 | 7 | |a satisfiabilité |2 inriac | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer science |x Mathematics | |
| 650 | 0 | 7 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Clique |g Graphentheorie |0 (DE-588)4449409-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphfärbung |0 (DE-588)4472286-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1993 |z New Brunswick NJ |2 gnd-content | |
| 689 | 0 | 0 | |a Clique |g Graphentheorie |0 (DE-588)4449409-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphfärbung |0 (DE-588)4472286-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Johnson, David S. |e Sonstige |4 oth | |
| 830 | 0 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 26 |w (DE-604)BV004648770 |9 26 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007463648&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007463648 | |
Record in the Search Index
| _version_ | 1820868081350606848 |
|---|---|
| adam_text |
Contents
Foreword xi
Introduction to the Second DIMACS Challenge: Cliques, coloring, and
satisfiability
David S. Johnson and Michael A. Trick 1
Clique
Polyhedral methods for the maximum clique problem
Egon Balas, Sabastian Ceria, Gerard Cornuejols, and
Gabor Pataki 11
Finding large cliques in arbitrary graphs by bipartite matching
Egon Balas and William Niehaus 29
An exact quadratic 0 1 algorithm for the stable set problem
Jean Marie Bourjolly, Paul Gill, Gilbert Laporte, and
Helene Mercure 53
Camouflaging independent sets in quasi random graphs
Mark Brockington and Joseph C. Culberson 75
Constructing cliques using restricted backtracking
Mark K. Goldberg and Reid D. Rivenburgh 89
A continuous based hueristic for the maximum clique problem
L. E. Gibbons, D. W. Hearn, and P. M. Pardalos 103
Applying the INN model to the Maximum Clique problem
Tal Grossman 125
Experiments with polynomial time CLIQUE approximation algorithms on
very large graphs
Steven Homer and Marcus Peinado 147
Approximately solving Maximum Clique using neural network and related
heuristics
Arun Jagota, Laura Sanchis, and Ravikanth Ganesan 169
vii
viii CONTENTS
Edge projection and the maximum cardinality stable set problem
Carlo Mannino and Antonio Sassano 205
Tabu search algorithms for the maximum clique problem
Patrick Soriano and Michel Gendreau 221
Coloring
Exploring the /c colorable landscape with Iterated Greedy
Joseph C. Culberson and Feng Luo 245
Coloring by tabu branch and bound
Fred Glover, Mark Parker, and Jennifer Ryan 285
Experiments with parallel graph coloring heuristics and applications of
graph coloring
Gary Lewandowski and Anne Condon 309
Distributed coloration neighborhood search
Craig Morgenstern 335
An improved algorithm for exact graph coloring
E. C. Sewell 359
Satisfiability
Random generation of test instances with controlled attributes
Yuichi Asahiro, Kazuo Iwama, and Eiji Miyano 377
A linear programming and rounding approach to max 2 sat
J. Cheriyan, W. H. Cunningham, L. TuNgEL, and Y. Wang 395
SAT versus UNSAT
O. Dubois, P. Andre, Y. Boufkhad, and J. Carlier 415
Large plateaus and plateau search in Boolean Satisfiability problems: When
to give up searching and start again
Steven Hampson and Dennis Kibler 437
Tabu search and a quadratic relaxation for the Satisfiability problem
Brigitte Jaumard, Mihnea Stan, and Jacques Desrosiers 457
Efficiency and stability of hypergraph SAT algorithms
Daniele Pretolani 479
A GRASP for satisfiability
Mauricio G. C. Resende and Thomas A. Feo 499
Local search strategies for satisfiability testing
Bart Selman. Henry Kautz, and Bram Cohen 521
CONTENTS ix
Simulated annealing for hard satisfiability problems
William M. Spears 533
Satisfiability testing with more reasoning and less guessing
Allen Van Gelder and Yumi K. Tsuji 559
Comparative studies of constraint satisfaction and Davis Putnam algo¬
rithms for maximum satisfiability problems
Richard J. Wallace and Eugene C. Freuder 587
Combination
Object oriented implementation of heuristic search methods for Graph Coloring,
Maximum Clique, and Satisfiability
Charles Fleurent and Jacques A. Ferland 619
Appendix: Second DIMACS Challenge test problems
Michael A. Trick 653 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV011137176 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 120 |
| ctrlnum | (OCoLC)34191924 (DE-599)BVBBV011137176 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV011137176</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19971023</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">970108s1996 xx d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821866095</subfield><subfield code="9">0-8218-6609-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34191924</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011137176</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cliques, coloring, and satisfiability</subfield><subfield code="b">second DIMACS Implementation Challenge, October 11-13, 1993</subfield><subfield code="c">David S. Johnson ..., ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, RI</subfield><subfield code="b">American Math. Soc.</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 657 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">26</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes - Informatique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">clique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">coloration graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">hypergraphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">satisfiabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Clique</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4449409-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphfärbung</subfield><subfield code="0">(DE-588)4472286-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1993</subfield><subfield code="z">New Brunswick NJ</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Clique</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4449409-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graphfärbung</subfield><subfield code="0">(DE-588)4472286-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">26</subfield><subfield code="w">(DE-604)BV004648770</subfield><subfield code="9">26</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007463648&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007463648</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1993 New Brunswick NJ gnd-content |
| genre_facet | Konferenzschrift 1993 New Brunswick NJ |
| id | DE-604.BV011137176 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:18:42Z |
| institution | BVB |
| isbn | 0821866095 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007463648 |
| oclc_num | 34191924 |
| open_access_boolean | |
| owner | DE-384 DE-83 |
| owner_facet | DE-384 DE-83 |
| physical | XI, 657 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | American Math. Soc. |
| record_format | marc |
| series | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| series2 | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| spelling | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 David S. Johnson ..., ed. Providence, RI American Math. Soc. 1996 XI, 657 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 26 Algorithmes - Informatique ram algorithme graphe inriac clique inriac coloration graphe inriac combinatoire inriac graphe inriac hypergraphe inriac satisfiabilité inriac Informatik Mathematik Computer algorithms Computer science Mathematics Erfüllbarkeitsproblem (DE-588)4323820-8 gnd rswk-swf Clique Graphentheorie (DE-588)4449409-9 gnd rswk-swf Graphfärbung (DE-588)4472286-2 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1993 New Brunswick NJ gnd-content Clique Graphentheorie (DE-588)4449409-9 s DE-604 Graphfärbung (DE-588)4472286-2 s Erfüllbarkeitsproblem (DE-588)4323820-8 s Johnson, David S. Sonstige oth Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 26 (DE-604)BV004648770 26 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007463648&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science Algorithmes - Informatique ram algorithme graphe inriac clique inriac coloration graphe inriac combinatoire inriac graphe inriac hypergraphe inriac satisfiabilité inriac Informatik Mathematik Computer algorithms Computer science Mathematics Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Clique Graphentheorie (DE-588)4449409-9 gnd Graphfärbung (DE-588)4472286-2 gnd |
| subject_GND | (DE-588)4323820-8 (DE-588)4449409-9 (DE-588)4472286-2 (DE-588)1071861417 |
| title | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 |
| title_auth | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 |
| title_exact_search | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 |
| title_full | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 David S. Johnson ..., ed. |
| title_fullStr | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 David S. Johnson ..., ed. |
| title_full_unstemmed | Cliques, coloring, and satisfiability second DIMACS Implementation Challenge, October 11-13, 1993 David S. Johnson ..., ed. |
| title_short | Cliques, coloring, and satisfiability |
| title_sort | cliques coloring and satisfiability second dimacs implementation challenge october 11 13 1993 |
| title_sub | second DIMACS Implementation Challenge, October 11-13, 1993 |
| topic | Algorithmes - Informatique ram algorithme graphe inriac clique inriac coloration graphe inriac combinatoire inriac graphe inriac hypergraphe inriac satisfiabilité inriac Informatik Mathematik Computer algorithms Computer science Mathematics Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Clique Graphentheorie (DE-588)4449409-9 gnd Graphfärbung (DE-588)4472286-2 gnd |
| topic_facet | Algorithmes - Informatique algorithme graphe clique coloration graphe combinatoire graphe hypergraphe satisfiabilité Informatik Mathematik Computer algorithms Computer science Mathematics Erfüllbarkeitsproblem Clique Graphentheorie Graphfärbung Konferenzschrift 1993 New Brunswick NJ |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007463648&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV004648770 |
| work_keys_str_mv | AT johnsondavids cliquescoloringandsatisfiabilityseconddimacsimplementationchallengeoctober11131993 |