Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 48 items.
- The complexity of multiple sequence alignment with SP-score that is a metric (Q5941270) (← links)
- Hardness and methods to solve CLIQUE (Q5959359) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)
- Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Metafinite model theory (Q6064289) (← links)
- On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863) (← links)
- (Q6084394) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
- Structure in approximation classes (Q6085751) (← links)
- MNP: A class of NP optimization problems (Q6085753) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- (Q6150942) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
- Algorithmic results on locating-total domination in graphs (Q6157416) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)
- The complexity of spanning tree problems involving graphical indices (Q6202942) (← links)
- An approximation algorithm for alphabet indexing problem (Q6487939) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
- Improved approximations of independent dominating set in bounded degree graphs (Q6550528) (← links)
- On the hardness of allocating frequencies for hybrid networks (Q6550553) (← links)
- On approximation of multiple intruder locating domination number of a graph (Q6551048) (← links)
- Approximation algorithms for partial vertex covers in trees (Q6554733) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Parallel approximation of optimization problems (Q6560202) (← links)
- Combinatorial upper bounds for the smallest eigenvalue of a graph (Q6564137) (← links)
- Minimizing total completion time with machine-dependent priority lists (Q6586213) (← links)
- An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint (Q6614024) (← links)
- Approximating multiobjective optimization problems: how exact can you be? (Q6616269) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Algorithmic aspects of total vertex-edge domination in graphs (Q6629669) (← links)
- Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)
- String editing under pattern constraints (Q6646447) (← links)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)
- On approximating partial scenario set cover (Q6652422) (← links)
