Recommendations
Cited in
(70)- Reducing hypergraph coloring to clique search
- Finding Hamiltonian circuits in quasi-adjoint graphs
- Travelling salesman problem in tissue P systems with costs
- Reductions among number theoretic problems
- Notes on computational-to-statistical gaps: predictions using statistical physics
- Linearly-growing reductions of Karp's 21 NP-complete problems
- Graph coloring approach with new upper bounds for the chromatic number: team building application
- Minimizing a sum of clipped convex functions
- Efficient network dismantling via node explosive percolation
- Reducibility among combinatorial problems (1972)
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Hitting subgraphs in \(P_4\)-tidy graphs
- Reducibility among combinatorial problems
- scientific article; zbMATH DE number 7651222 (Why is no real title available?)
- Bayesian network learning via topological order
- Continuous relaxations for the traveling salesman problem
- Combinatorics of reductions between equivalence relations
- A new formula for the decycling number of regular graphs
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- \textsc{max-cut} and containment relations in graphs
- Resolving sets in temporal graphs
- Approximation algorithms for clustering with dynamic points
- Online combinatorial assignment in independence systems
- Approximation algorithms for clustering with dynamic points
- A lower bound for the breakpoint phylogeny problem
- Forming \(k\) coalitions and facilitating relationships in social networks
- Control: a perspective
- Online combinatorial assignment in independence systems
- Finding a tree structure in a resolution proof is NP-complete
- Dynamic programming for the subset sum problem
- Linear planar 3-SAT
- On the integrality ratio of the subtour LP for Euclidean TSP
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Strategies for parallel unaware cleaners
- On the parameterized complexity of Eulerian strong component arc deletion
- Integer programming models for the multidimensional assignment problem with star costs
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Parameterized quantum query algorithms for graph problems
- Complexity of Restricted Variants of Skolem and Related Problems
- On the optimal rank-1 approximation of matrices in the Chebyshev norm
- QUBO formulation for aircraft load optimization
- Balancing U-type assembly lines with human-robot collaboration
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- On the complexity of working set selection
- Information design in the principal-agent problem
- Exact vertex migration model of graph partitioning based on mixed 0-1 linear programming and iteration algorithm
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Incorporating a database of graphs into a proof assistant
- On the parameterized complexity of diverse SAT
- Finding the longest isometric cycle in a graph
- Dynamic programming on bipartite tree decompositions
- An attention model for the formation of collectives in real-world domains
- Rectangle packing with additional restrictions
- Policy analysis for administrative role-based access control
- A cryptographer's Conspiracy Santa
- Forest covers
- Competitive query minimization for stable matching with one-sided uncertainty
- A faster cryptographer's Conspiracy Santa
- Dynamic programming on bipartite tree decompositions
- Computing a feedback arc set using PageRank
- On the parameterized complexity of Eulerian strong component arc deletion
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Approximate dynamic programming based on high dimensional model representation
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Computational complexity of k-block conjugacy
- A dynamic programming algorithm for tree-like weighted set packing problem
- Pattern masking for dictionary matching: theory and practice
- Architecture-aware synthesis of phase polynomials for NISQ devices
This page was built for publication: Reducibility among combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565237)
