Pages that link to "Item:Q958303"

The following pages link to Approximation hardness of dominating set problems in bounded degree graphs (Q958303):

Displaying 50 items.

• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
• New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
• Approximation complexity of metric dimension problem (Q450564) (← links)
• Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
• Independent dominating set problem revisited (Q476836) (← links)
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
• Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
• Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
• An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
• Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
• Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
• Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
• Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
• Domination in some subclasses of bipartite graphs (Q1630774) (← links)
• Subset sum problems with digraph constraints (Q1631654) (← links)
• Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
• The complexity of secure domination problem in graphs (Q1708386) (← links)
• Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
• On directed covering and domination problems (Q1735678) (← links)
• Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
• Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
• Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
• Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
• Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
• On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
• Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
• On dominating set of some subclasses of string graphs (Q2144448) (← links)
• Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
• Leafy spanning \(k\)-forests (Q2165258) (← links)
• Complexity of edge monitoring on some graph classes (Q2172388) (← links)
• Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
• Greed is good for deterministic scale-free networks (Q2205637) (← links)
• Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
• On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Generalized threshold processes on graphs (Q2402258) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
• Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
• CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS (Q2874035) (← links)
• Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
• On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
• Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
• Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)