Matches in SemOpenAlex for { <https://semopenalex.org/work/W2128101403> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W2128101403 abstract "Given a tree T = (V, E) with costs defined on edges, a positive integer k, and I terminal sets {S <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> , S <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> , . . ., S <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>l</sub> } with every S <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> sube V, the generalized k-multicut in trees problem (k-GMC(T)) asks to find an edge subset in E at the minimum cost such that its removal cuts at least k terminal sets. The k-GMC(T) problem is a natural generalization of the classical multicut in trees problem and the multiway cut in trees problem. This problem is hard to be approximated within O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1/6-isin</sup> ) for some small constant isin > 0 (Zhang, CiE'07). Based on a greedy approach and a rounding technique in linear programming, we give a bicriteria approximation algorithm for k-GMC(T). Our algorithm outputs in polynomial time a solution which cuts at least (1 - isin)k terminal sets and whose cost is within radic2/isinldrl times of the optimum for any small constant isin > 0, and hence gives sublinear approximation ratio for k-GMC(T)." @default.
- W2128101403 created "2016-06-24" @default.
- W2128101403 creator A5024947550 @default.
- W2128101403 creator A5054206890 @default.
- W2128101403 creator A5061920098 @default.
- W2128101403 date "2009-04-01" @default.
- W2128101403 modified "2023-09-26" @default.
- W2128101403 title "A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees" @default.
- W2128101403 cites W1500396446 @default.
- W2128101403 cites W1558784115 @default.
- W2128101403 cites W1571257748 @default.
- W2128101403 cites W1971222832 @default.
- W2128101403 cites W2001139415 @default.
- W2128101403 cites W2011823863 @default.
- W2128101403 cites W2013355418 @default.
- W2128101403 cites W2019062750 @default.
- W2128101403 cites W2031248452 @default.
- W2128101403 cites W2036836182 @default.
- W2128101403 cites W2044343300 @default.
- W2128101403 cites W2052494364 @default.
- W2128101403 cites W2072802070 @default.
- W2128101403 cites W2102931907 @default.
- W2128101403 cites W2104768456 @default.
- W2128101403 cites W2152986618 @default.
- W2128101403 cites W3009415557 @default.
- W2128101403 doi "https://doi.org/10.1109/cso.2009.361" @default.
- W2128101403 hasPublicationYear "2009" @default.
- W2128101403 type Work @default.
- W2128101403 sameAs 2128101403 @default.
- W2128101403 citedByCount "1" @default.
- W2128101403 countsByYear W21281014032012 @default.
- W2128101403 crossrefType "proceedings-article" @default.
- W2128101403 hasAuthorship W2128101403A5024947550 @default.
- W2128101403 hasAuthorship W2128101403A5054206890 @default.
- W2128101403 hasAuthorship W2128101403A5061920098 @default.
- W2128101403 hasConcept C111919701 @default.
- W2128101403 hasConcept C113174947 @default.
- W2128101403 hasConcept C11413529 @default.
- W2128101403 hasConcept C114614502 @default.
- W2128101403 hasConcept C118615104 @default.
- W2128101403 hasConcept C134306372 @default.
- W2128101403 hasConcept C136625980 @default.
- W2128101403 hasConcept C148764684 @default.
- W2128101403 hasConcept C154945302 @default.
- W2128101403 hasConcept C177148314 @default.
- W2128101403 hasConcept C33923547 @default.
- W2128101403 hasConcept C41008148 @default.
- W2128101403 hasConceptScore W2128101403C111919701 @default.
- W2128101403 hasConceptScore W2128101403C113174947 @default.
- W2128101403 hasConceptScore W2128101403C11413529 @default.
- W2128101403 hasConceptScore W2128101403C114614502 @default.
- W2128101403 hasConceptScore W2128101403C118615104 @default.
- W2128101403 hasConceptScore W2128101403C134306372 @default.
- W2128101403 hasConceptScore W2128101403C136625980 @default.
- W2128101403 hasConceptScore W2128101403C148764684 @default.
- W2128101403 hasConceptScore W2128101403C154945302 @default.
- W2128101403 hasConceptScore W2128101403C177148314 @default.
- W2128101403 hasConceptScore W2128101403C33923547 @default.
- W2128101403 hasConceptScore W2128101403C41008148 @default.
- W2128101403 hasLocation W21281014031 @default.
- W2128101403 hasOpenAccess W2128101403 @default.
- W2128101403 hasPrimaryLocation W21281014031 @default.
- W2128101403 hasRelatedWork W1527913068 @default.
- W2128101403 hasRelatedWork W1971753667 @default.
- W2128101403 hasRelatedWork W1978042415 @default.
- W2128101403 hasRelatedWork W1997271576 @default.
- W2128101403 hasRelatedWork W2052275678 @default.
- W2128101403 hasRelatedWork W2068208308 @default.
- W2128101403 hasRelatedWork W2118005842 @default.
- W2128101403 hasRelatedWork W2348187822 @default.
- W2128101403 hasRelatedWork W3183323092 @default.
- W2128101403 hasRelatedWork W4300746587 @default.
- W2128101403 isParatext "false" @default.
- W2128101403 isRetracted "false" @default.
- W2128101403 magId "2128101403" @default.
- W2128101403 workType "article" @default.