Pages that link to "Item:Q1307344"
From MaRDI portal
The following pages link to Primal-dual approximation algorithms for feedback problems in planar graphs (Q1307344):
Displaying 17 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity (Q2085734) (← links)
- The ferry cover problem (Q2272191) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions (Q6133163) (← links)
