Pages that link to "Item:Q2345984"
From MaRDI portal
The following pages link to New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984):
Displayed 9 items.
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)
- (Q5090486) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)