Pages that link to "Item:Q1566710"
From MaRDI portal
The following pages link to Some APX-completeness results for cubic graphs (Q1566710):
Displaying 50 items.
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs (Q1044047) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Approximability and exact resolution of the multidimensional binary vector assignment problem (Q1631661) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- On the complexity of computing MP distance between binary phylogenetic trees (Q1682616) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← 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 upper edge domination (Q2034795) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
- Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- Extending simple drawings (Q2206853) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
