Search: id:"swepub:oai:lup.lub.lu.se:f47a1070-db82-4c37-bd86-f519303fdde7" >
Determinant sums fo...
-
Björklund, AndreasLund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH
(author)
Determinant sums for undirected Hamiltonicity
- Article/chapterEnglish2010
Publisher, publication year, extent ...
Numbers
-
LIBRIS-ID:oai:lup.lub.lu.se:f47a1070-db82-4c37-bd86-f519303fdde7
-
https://lup.lub.lu.se/record/1666240URI
-
https://doi.org/10.1109/FOCS.2010.24DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:kon swepub-publicationtype
-
Subject category:ref swepub-contenttype
Notes
-
Abstract in UndeterminedWe present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O*(1.657(n)) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O*(2(n)) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's 2003 survey on exact algorithms for NP-hard problems.For bipartite graphs, we improve the bound to O*(1.414(n)) time. Both the bipartite and the general algorithm can be implemented to use space polynomial in n.We combine several recently resurrected ideas to get the results. Our main technical contribution is a new reduction inspired by the algebraic sieving method for k-Path (Koutis ICALP 2008, Williams IPL 2009). We introduce the Labeled Cycle Cover Sum in which we are set to count weighted arc labeled cycle covers over a finite field of characteristic two. We reduce Hamiltonicity to Labeled Cycle Cover Sum and apply the determinant summation technique for Exact Set Covers (Bjorklund STACS 2010) to evaluate it.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Institutionen för datavetenskapInstitutioner vid LTH
(creator_code:org_t)
Related titles
-
In:2010 IEEE 51st Annual Symposium On Foundations Of Computer Science, s. 173-1820272-54289780769542447
Internet link
Find in a library
To the university's database