Pages that link to "Item:Q1602689"
From MaRDI portal
The following pages link to A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689):
Displayed 35 items.
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← 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)
- 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)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← 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)
- (Q5090486) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- Graph covering using bounded size subgraphs (Q6132557) (← links)