Matches in SemOpenAlex for { <https://semopenalex.org/work/W1575855070> ?p ?o ?g. }
Showing items 1 to 43 of
43
with 100 items per page.
- W1575855070 endingPage "211" @default.
- W1575855070 startingPage "201" @default.
- W1575855070 abstract "The analysis of algorithms on semirandom graph instances intermediates smoothly between the analysis in the worst case and the average case. The aim of this paper is to present an algorithm for finding a large independent set in a semirandom graph in polynomial expected time, thereby extending the work of Feige and Kilian [4]. In order to preprocess the input graph, the algorithm makes use of SDP-based techniques. The analysis of the algorithm shows that not only is the expected running time polynomial, but even arbitrary moments of the running time are polynomial in the number of vertices of the input graph. The algorithm for the independent set problem yields an algorithm for k-coloring semirandom k-colorable graphs, and for the latter algorithm a similar result concerning its running time holds, as also for the independent set algorithm. The results on both problems are essentially best-possible, by the hardness results obtained in [4]." @default.
- W1575855070 created "2016-06-24" @default.
- W1575855070 creator A5044991483 @default.
- W1575855070 date "2002-01-01" @default.
- W1575855070 modified "2023-09-24" @default.
- W1575855070 title "Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming" @default.
- W1575855070 cites W1987178221 @default.
- W1575855070 cites W2088272899 @default.
- W1575855070 cites W2130857672 @default.
- W1575855070 doi "https://doi.org/10.1007/3-540-45687-2_16" @default.
- W1575855070 hasPublicationYear "2002" @default.
- W1575855070 type Work @default.
- W1575855070 sameAs 1575855070 @default.
- W1575855070 citedByCount "1" @default.
- W1575855070 crossrefType "book-chapter" @default.
- W1575855070 hasAuthorship W1575855070A5044991483 @default.
- W1575855070 hasConcept C101901036 @default.
- W1575855070 hasConcept C114614502 @default.
- W1575855070 hasConcept C126255220 @default.
- W1575855070 hasConcept C33923547 @default.
- W1575855070 hasConceptScore W1575855070C101901036 @default.
- W1575855070 hasConceptScore W1575855070C114614502 @default.
- W1575855070 hasConceptScore W1575855070C126255220 @default.
- W1575855070 hasConceptScore W1575855070C33923547 @default.
- W1575855070 hasLocation W15758550701 @default.
- W1575855070 hasOpenAccess W1575855070 @default.
- W1575855070 hasPrimaryLocation W15758550701 @default.
- W1575855070 hasRelatedWork W1968116383 @default.
- W1575855070 hasRelatedWork W1978042415 @default.
- W1575855070 hasRelatedWork W2017331178 @default.
- W1575855070 hasRelatedWork W2071738309 @default.
- W1575855070 hasRelatedWork W2333955266 @default.
- W1575855070 hasRelatedWork W2896014810 @default.
- W1575855070 hasRelatedWork W2976797620 @default.
- W1575855070 hasRelatedWork W3086542228 @default.
- W1575855070 hasRelatedWork W3122376971 @default.
- W1575855070 hasRelatedWork W4321392793 @default.
- W1575855070 isParatext "false" @default.
- W1575855070 isRetracted "false" @default.
- W1575855070 magId "1575855070" @default.
- W1575855070 workType "book-chapter" @default.