Matches in SemOpenAlex for { <https://semopenalex.org/work/W2116729599> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2116729599 abstract "In this paper we study a capacitated version of the classical max-k-cut problem. Given a graph we are to partition the vertices into k equal-sized sets such that the number of edges across the sets is maximized. We present a deterministic approximation algorithm for this problem with performance ratio (k – 1) / k. Our algorithm is based on local search, a technique that has been applied to a variety of combinatorial optimization problems." @default.
- W2116729599 created "2016-06-24" @default.
- W2116729599 creator A5014255932 @default.
- W2116729599 creator A5050039766 @default.
- W2116729599 date "2005-01-01" @default.
- W2116729599 modified "2023-10-14" @default.
- W2116729599 title "The Capacitated max-k-cut Problem" @default.
- W2116729599 cites W1601503375 @default.
- W2116729599 cites W1985123706 @default.
- W2116729599 cites W2043506441 @default.
- W2116729599 cites W2063046368 @default.
- W2116729599 cites W2074617595 @default.
- W2116729599 cites W2086917808 @default.
- W2116729599 cites W99679382 @default.
- W2116729599 doi "https://doi.org/10.1007/11424925_71" @default.
- W2116729599 hasPublicationYear "2005" @default.
- W2116729599 type Work @default.
- W2116729599 sameAs 2116729599 @default.
- W2116729599 citedByCount "4" @default.
- W2116729599 crossrefType "book-chapter" @default.
- W2116729599 hasAuthorship W2116729599A5014255932 @default.
- W2116729599 hasAuthorship W2116729599A5050039766 @default.
- W2116729599 hasConcept C11413529 @default.
- W2116729599 hasConcept C114614502 @default.
- W2116729599 hasConcept C126255220 @default.
- W2116729599 hasConcept C132525143 @default.
- W2116729599 hasConcept C136197465 @default.
- W2116729599 hasConcept C148764684 @default.
- W2116729599 hasConcept C154945302 @default.
- W2116729599 hasConcept C165526019 @default.
- W2116729599 hasConcept C33923547 @default.
- W2116729599 hasConcept C41008148 @default.
- W2116729599 hasConcept C42812 @default.
- W2116729599 hasConcept C48903430 @default.
- W2116729599 hasConcept C52692508 @default.
- W2116729599 hasConcept C80444323 @default.
- W2116729599 hasConceptScore W2116729599C11413529 @default.
- W2116729599 hasConceptScore W2116729599C114614502 @default.
- W2116729599 hasConceptScore W2116729599C126255220 @default.
- W2116729599 hasConceptScore W2116729599C132525143 @default.
- W2116729599 hasConceptScore W2116729599C136197465 @default.
- W2116729599 hasConceptScore W2116729599C148764684 @default.
- W2116729599 hasConceptScore W2116729599C154945302 @default.
- W2116729599 hasConceptScore W2116729599C165526019 @default.
- W2116729599 hasConceptScore W2116729599C33923547 @default.
- W2116729599 hasConceptScore W2116729599C41008148 @default.
- W2116729599 hasConceptScore W2116729599C42812 @default.
- W2116729599 hasConceptScore W2116729599C48903430 @default.
- W2116729599 hasConceptScore W2116729599C52692508 @default.
- W2116729599 hasConceptScore W2116729599C80444323 @default.
- W2116729599 hasLocation W21167295991 @default.
- W2116729599 hasOpenAccess W2116729599 @default.
- W2116729599 hasPrimaryLocation W21167295991 @default.
- W2116729599 hasRelatedWork W1907897951 @default.
- W2116729599 hasRelatedWork W2006228567 @default.
- W2116729599 hasRelatedWork W2057623054 @default.
- W2116729599 hasRelatedWork W2095219966 @default.
- W2116729599 hasRelatedWork W2113137767 @default.
- W2116729599 hasRelatedWork W2352204564 @default.
- W2116729599 hasRelatedWork W2371447506 @default.
- W2116729599 hasRelatedWork W2386767533 @default.
- W2116729599 hasRelatedWork W2517127789 @default.
- W2116729599 hasRelatedWork W2748952813 @default.
- W2116729599 isParatext "false" @default.
- W2116729599 isRetracted "false" @default.
- W2116729599 magId "2116729599" @default.
- W2116729599 workType "book-chapter" @default.