Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- The transitive minimum Manhattan subnetwork problem in 3 dimensions (Q968145) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A mixed integer linear programming formulation of the maximum betweenness problem (Q976481) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Efficient delay routing (Q1128715) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
- Alphabet indexing for approximating features of symbols (Q1274598) (← links)
- On the approximation of protein threading (Q1274599) (← links)
- On the hardness of allocating frequencies for hybrid networks (Q1274935) (← links)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
