Pages that link to "Item:Q1566710"
From MaRDI portal
The following pages link to Some APX-completeness results for cubic graphs (Q1566710):
Displayed 32 items.
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- 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)
- 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)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- The source location problem with local 3-vertex-connectivity requirements (Q2462389) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- Sports tournaments, home-away assignments, and the break minimization problem (Q2506823) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- On Finding Small 2-Generating Sets (Q5323086) (← links)
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs (Q5387743) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)