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.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- A combinatorial model and algorithm for globally searching community structure in complex networks (Q437056) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Correcting gene trees by leaf insertions: complexity and approximation (Q737083) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- 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)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Approximability of clausal constraints (Q970111) (← 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)
