On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
2004
|
| _version_ | 1797052846971027456 |
|---|---|
| author | de Klerk, E Pasechnik, D Warners, J |
| author_facet | de Klerk, E Pasechnik, D Warners, J |
| author_sort | de Klerk, E |
| collection | OXFORD |
| description | |
| first_indexed | 2024-03-06T18:36:25Z |
| format | Journal article |
| id | oxford-uuid:0b660a20-54ab-41f1-9ea3-a38a8a9aadf1 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:36:25Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | oxford-uuid:0b660a20-54ab-41f1-9ea3-a38a8a9aadf12022-03-26T09:29:11ZOn approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−functionJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:0b660a20-54ab-41f1-9ea3-a38a8a9aadf1Department of Computer Science2004de Klerk, EPasechnik, DWarners, J |
| spellingShingle | de Klerk, E Pasechnik, D Warners, J On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title | On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title_full | On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title_fullStr | On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title_full_unstemmed | On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title_short | On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function |
| title_sort | on approximate graph colouring and max k cut algorithms based on the ϑ function |
| work_keys_str_mv | AT deklerke onapproximategraphcolouringandmaxkcutalgorithmsbasedonthethfunction AT pasechnikd onapproximategraphcolouringandmaxkcutalgorithmsbasedonthethfunction AT warnersj onapproximategraphcolouringandmaxkcutalgorithmsbasedonthethfunction |