Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Order consolidation for batch processing (Q1774533) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- On the complexity of finding emerging patterns (Q1781987) (← links)
- Minimizing the number of switch instances on a flexible machine in polynomial time (Q1785367) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Derandomized graph products (Q1842777) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- Methods for reconstructing the history of tandem repeats and their application to the human genome. (Q1872719) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
- On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
- Donation center location problem (Q1949758) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds (Q2037107) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Positive influence domination in graphs (Q2082361) (← links)
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
