Pages that link to "Item:Q3565237"
From MaRDI portal
The following pages link to Reducibility Among Combinatorial Problems (Q3565237):
Displaying 45 items.
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Control: a perspective (Q463779) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Policy analysis for administrative role-based access control (Q655414) (← links)
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- A lower bound for the breakpoint phylogeny problem (Q876716) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Finding the longest isometric cycle in a graph (Q967311) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Forming \(k\) coalitions and facilitating relationships in social networks (Q1647520) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem (Q2056687) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A faster cryptographer's Conspiracy Santa (Q2196567) (← links)
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- Minimizing a sum of clipped convex functions (Q2228412) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- Dynamic programming for the subset sum problem (Q2658814) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Approximate Dynamic Programming based on High Dimensional Model Representation (Q2868781) (← links)
- (Q3305731) (← links)
- Efficient Network Dismantling via Node Explosive Percolation* (Q3387781) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- (Q4637014) (← links)
- Complexity of Restricted Variants of Skolem and Related Problems (Q5111295) (← links)
- Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
- (Q5874506) (← links)
- (Q5874556) (← links)
- Balancing U-type assembly lines with human-robot collaboration (Q6047919) (← links)
- On the optimal rank-1 approximation of matrices in the Chebyshev norm (Q6084872) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- An attention model for the formation of collectives in real-world domains (Q6494351) (← links)
