Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Approximability results for the converse connected<i>p</i>-centre problem<sup>†</sup> (Q2958261) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)
- Approximation of a batch consolidation problem (Q3113503) (← links)
- (Q3132650) (← links)
- Algorithmic Aspect of Minus Domination on Small-Degree Graphs (Q3196397) (← links)
- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks (Q3404476) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- Approximating Alternative Solutions (Q3511329) (← links)
- Probabilistic CEGAR (Q3512491) (← links)
- Local Monotonicity in Probabilistic Networks (Q3524964) (← links)
- On the hardness of range assignment problems (Q3548718) (← links)
- atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)
- Cost Minimisation in Multi-interface Networks (Q3614996) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- On Approximating an Implicit Cover Problem in Biology (Q3638443) (← links)
- Completeness in approximation classes (Q3974859) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Polynomial time approximation of dense weighted instances of MAX-CUT (Q4500688) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- NP-completeness: A retrospective (Q4571936) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- Complexity and approximation ratio of semitotal domination in graphs (Q4583541) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
- Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
- Proving completeness by logic (Q4653719) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- Recent results in hardness of approximation (Q5054764) (← links)
