Matches in SemOpenAlex for { <https://semopenalex.org/work/W4316652289> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W4316652289 endingPage "2086" @default.
- W4316652289 startingPage "2069" @default.
- W4316652289 abstract "We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the graph can be undirected or directed. The family of cycles under consideration must satisfy two properties: it must be uncrossable and allow for an oracle access that finds a weight-minimal cycle in that family for given nonnegative edge weights or (in planar graphs) the union of all remaining cycles in that family after deleting a given subset of edges.Our setting generalizes many problems that were studied separately in the past. For example, three families that satisfy the above properties are (i) all cycles in a directed or undirected graph, (ii) all odd cycles in an undirected graph, and (iii) all cycles in an undirected graph that contain precisely one demand edge, where the demand edges form a subset of the edge set. The latter family (iii) corresponds to the classical disjoint paths problem in fully planar and bounded-genus instances. While constant-factor approximation algorithms were known for edge-disjoint paths in such instances, we improve the constant in the planar case and obtain the first such algorithms for vertex-disjoint paths. We also obtain approximate min-max theorems of the Erdős-Póosa type. For example, the minimum feedback vertex set in a planar digraph is at most 12 times the maximum number of vertex-disjoint cycles." @default.
- W4316652289 created "2023-01-17" @default.
- W4316652289 creator A5006771715 @default.
- W4316652289 creator A5028076811 @default.
- W4316652289 creator A5077954211 @default.
- W4316652289 date "2023-01-01" @default.
- W4316652289 modified "2023-09-26" @default.
- W4316652289 title "Packing cycles in planar and bounded-genus graphs" @default.
- W4316652289 doi "https://doi.org/10.1137/1.9781611977554.ch79" @default.
- W4316652289 hasPublicationYear "2023" @default.
- W4316652289 type Work @default.
- W4316652289 citedByCount "0" @default.
- W4316652289 crossrefType "book-chapter" @default.
- W4316652289 hasAuthorship W4316652289A5006771715 @default.
- W4316652289 hasAuthorship W4316652289A5028076811 @default.
- W4316652289 hasAuthorship W4316652289A5077954211 @default.
- W4316652289 hasBestOaLocation W43166522892 @default.
- W4316652289 hasConcept C101837359 @default.
- W4316652289 hasConcept C114614502 @default.
- W4316652289 hasConcept C118615104 @default.
- W4316652289 hasConcept C132525143 @default.
- W4316652289 hasConcept C134306372 @default.
- W4316652289 hasConcept C146380142 @default.
- W4316652289 hasConcept C2779145032 @default.
- W4316652289 hasConcept C33923547 @default.
- W4316652289 hasConcept C34388435 @default.
- W4316652289 hasConcept C45340560 @default.
- W4316652289 hasConcept C80899671 @default.
- W4316652289 hasConceptScore W4316652289C101837359 @default.
- W4316652289 hasConceptScore W4316652289C114614502 @default.
- W4316652289 hasConceptScore W4316652289C118615104 @default.
- W4316652289 hasConceptScore W4316652289C132525143 @default.
- W4316652289 hasConceptScore W4316652289C134306372 @default.
- W4316652289 hasConceptScore W4316652289C146380142 @default.
- W4316652289 hasConceptScore W4316652289C2779145032 @default.
- W4316652289 hasConceptScore W4316652289C33923547 @default.
- W4316652289 hasConceptScore W4316652289C34388435 @default.
- W4316652289 hasConceptScore W4316652289C45340560 @default.
- W4316652289 hasConceptScore W4316652289C80899671 @default.
- W4316652289 hasLocation W43166522891 @default.
- W4316652289 hasLocation W43166522892 @default.
- W4316652289 hasOpenAccess W4316652289 @default.
- W4316652289 hasPrimaryLocation W43166522891 @default.
- W4316652289 hasRelatedWork W1971296834 @default.
- W4316652289 hasRelatedWork W2350235717 @default.
- W4316652289 hasRelatedWork W2963699585 @default.
- W4316652289 hasRelatedWork W2998932593 @default.
- W4316652289 hasRelatedWork W3109685666 @default.
- W4316652289 hasRelatedWork W3135656566 @default.
- W4316652289 hasRelatedWork W3185918591 @default.
- W4316652289 hasRelatedWork W3206407623 @default.
- W4316652289 hasRelatedWork W4206244388 @default.
- W4316652289 hasRelatedWork W4320340728 @default.
- W4316652289 isParatext "false" @default.
- W4316652289 isRetracted "false" @default.
- W4316652289 workType "book-chapter" @default.