Pages that link to "Item:Q958303"

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

Displaying 38 items.

• 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)
• Approximating the domatic number (Q3191980) (← links)
• Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
• (Q4680214) (← links)
• (Q4691865) (← links)
• Approximating theDomatic Number (Q4785636) (← links)
• Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
• Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
• Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
• On Directed Covering and Domination Problems (Q5136265) (← links)
• The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
• Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs (Q5385974) (← links)
• Algorithms – ESA 2004 (Q5464578) (← links)
• Computing and Combinatorics (Q5716997) (← links)
• Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
• Fundamentals of Computation Theory (Q5900783) (← links)
• Approximation Algorithms and Hardness for Domination with Propagation (Q5901134) (← links)
• Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
• Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
• On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
• Hardness results of global total \(k\)-domination problem in graphs (Q5918768) (← links)
• On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
• Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
• Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)
• (Q6150942) (← links)
• Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
• Complexity of total dominator coloring in graphs (Q6184152) (← links)
• On the complexity of co-secure dominating set problem (Q6195337) (← links)
• Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
• Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)
• More on the complexity of defensive domination in graphs (Q6657275) (← links)
• Complexity issues concerning the quadruple Roman domination problem in graphs (Q6658307) (← links)
• Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)