Matches in SemOpenAlex for { <https://semopenalex.org/work/W1567483970> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W1567483970 endingPage "275" @default.
- W1567483970 startingPage "264" @default.
- W1567483970 abstract "We study the complexity of local search in the max-cut problem with FLIP neighborhood, in which exactly one node changes the partition. We introduce a technique of constructing instances which enforce certain sequences of improving steps. Using our technique we can show that already graphs with maximum degree four satify the following two properties. Schäffer and Yannakakis (JOC ’91) showed via a so called “tight” PLS-reduction that the properties (1) and (2) hold for graphs with unbounded degree. Our improvement to the degree four is the best possible improvement since Poljak (JOC ’95) showed for cubic graphs that every sequence of improving steps has polynomial length, whereby his result is easily generalizable to arbitrary graphs with maximum degree three. In his paper Poljak also asked whether (1) holds for graphs with maximum degree four, which is settled by our result. Many tight PLS-reductions in the literature are based on the max-cut problem. Via some of them our constructions carry over to other problems and show that the properties (1) and (2) already hold for very restricted sets of feasible inputs of these problems. Since our paper provides the two results that typically come along with tight PLS-reductions it does naturally put the focus on the question whether it is even PLS-complete to compute a local optimum on graphs with maximum degree four – a question that was recently asked by Ackermann et al. We think that our insights might be helpful for tackling this question." @default.
- W1567483970 created "2016-06-24" @default.
- W1567483970 creator A5083058621 @default.
- W1567483970 creator A5086678348 @default.
- W1567483970 date "2010-01-01" @default.
- W1567483970 modified "2023-10-02" @default.
- W1567483970 title "On the Power of Nodes of Degree Four in the Local Max-Cut Problem" @default.
- W1567483970 cites W1500428599 @default.
- W1567483970 cites W1697862064 @default.
- W1567483970 cites W190864877 @default.
- W1567483970 cites W1978317291 @default.
- W1567483970 cites W2054129049 @default.
- W1567483970 cites W2062459871 @default.
- W1567483970 cites W2074104906 @default.
- W1567483970 cites W2088956149 @default.
- W1567483970 cites W2108614294 @default.
- W1567483970 cites W2117935782 @default.
- W1567483970 cites W2121956325 @default.
- W1567483970 cites W2132958733 @default.
- W1567483970 cites W2145297839 @default.
- W1567483970 cites W2167101557 @default.
- W1567483970 cites W4238018361 @default.
- W1567483970 doi "https://doi.org/10.1007/978-3-642-13073-1_24" @default.
- W1567483970 hasPublicationYear "2010" @default.
- W1567483970 type Work @default.
- W1567483970 sameAs 1567483970 @default.
- W1567483970 citedByCount "16" @default.
- W1567483970 countsByYear W15674839702013 @default.
- W1567483970 countsByYear W15674839702014 @default.
- W1567483970 countsByYear W15674839702015 @default.
- W1567483970 countsByYear W15674839702017 @default.
- W1567483970 countsByYear W15674839702019 @default.
- W1567483970 crossrefType "book-chapter" @default.
- W1567483970 hasAuthorship W1567483970A5083058621 @default.
- W1567483970 hasAuthorship W1567483970A5086678348 @default.
- W1567483970 hasConcept C111335779 @default.
- W1567483970 hasConcept C114614502 @default.
- W1567483970 hasConcept C118615104 @default.
- W1567483970 hasConcept C121332964 @default.
- W1567483970 hasConcept C132525143 @default.
- W1567483970 hasConcept C165526019 @default.
- W1567483970 hasConcept C24890656 @default.
- W1567483970 hasConcept C2524010 @default.
- W1567483970 hasConcept C2775997480 @default.
- W1567483970 hasConcept C33923547 @default.
- W1567483970 hasConcept C41008148 @default.
- W1567483970 hasConcept C42812 @default.
- W1567483970 hasConceptScore W1567483970C111335779 @default.
- W1567483970 hasConceptScore W1567483970C114614502 @default.
- W1567483970 hasConceptScore W1567483970C118615104 @default.
- W1567483970 hasConceptScore W1567483970C121332964 @default.
- W1567483970 hasConceptScore W1567483970C132525143 @default.
- W1567483970 hasConceptScore W1567483970C165526019 @default.
- W1567483970 hasConceptScore W1567483970C24890656 @default.
- W1567483970 hasConceptScore W1567483970C2524010 @default.
- W1567483970 hasConceptScore W1567483970C2775997480 @default.
- W1567483970 hasConceptScore W1567483970C33923547 @default.
- W1567483970 hasConceptScore W1567483970C41008148 @default.
- W1567483970 hasConceptScore W1567483970C42812 @default.
- W1567483970 hasLocation W15674839701 @default.
- W1567483970 hasOpenAccess W1567483970 @default.
- W1567483970 hasPrimaryLocation W15674839701 @default.
- W1567483970 hasRelatedWork W1516407058 @default.
- W1567483970 hasRelatedWork W1630368312 @default.
- W1567483970 hasRelatedWork W1978042415 @default.
- W1567483970 hasRelatedWork W1996842245 @default.
- W1567483970 hasRelatedWork W2052299887 @default.
- W1567483970 hasRelatedWork W2324782219 @default.
- W1567483970 hasRelatedWork W2728224919 @default.
- W1567483970 hasRelatedWork W2951521427 @default.
- W1567483970 hasRelatedWork W2963114048 @default.
- W1567483970 hasRelatedWork W4323666601 @default.
- W1567483970 isParatext "false" @default.
- W1567483970 isRetracted "false" @default.
- W1567483970 magId "1567483970" @default.
- W1567483970 workType "book-chapter" @default.