Pages that link to "Item:Q2369972"
From MaRDI portal
The following pages link to Approximation hardness of edge dominating set problems (Q2369972):
Displaying 27 items.
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- A note on approximations of directed edge dominating set (Q2094379) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- (Q5077148) (← links)
- (Q5090486) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- (Q5875458) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
