Reducibility Among Combinatorial Problems
From MaRDI portal
Publication:3565237
DOI10.1007/978-3-540-68279-0_8zbMath1187.90014OpenAlexW1975442866MaRDI QIDQ3565237
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_8
Combinatorial optimization (90C27) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)
Related Items (45)
Unnamed Item ⋮ On the complexity of working set selection ⋮ A dynamic programming algorithm for tree-like weighted set packing problem ⋮ Forming \(k\) coalitions and facilitating relationships in social networks ⋮ Approximation algorithms for clustering with dynamic points ⋮ Dynamic programming for the subset sum problem ⋮ A new formula for the decycling number of regular graphs ⋮ A lower bound for the breakpoint phylogeny problem ⋮ Preprocessing to reduce the search space: antler structures for feedback vertex set ⋮ Balancing U-type assembly lines with human-robot collaboration ⋮ On the optimal rank-1 approximation of matrices in the Chebyshev norm ⋮ Reducing hypergraph coloring to clique search ⋮ Strategies for parallel unaware cleaners ⋮ Clustering in Hypergraphs to Minimize Average Edge Service Time ⋮ Computing a feedback arc set using PageRank ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ A faster cryptographer's Conspiracy Santa ⋮ An ETH-Tight Exact Algorithm for Euclidean TSP ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ \textsc{max-cut} and containment relations in graphs ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Rectangle packing with additional restrictions ⋮ Control: a perspective ⋮ Computational complexity of \(k\)-block conjugacy ⋮ Policy analysis for administrative role-based access control ⋮ Notes on computational-to-statistical gaps: predictions using statistical physics ⋮ Minimizing a sum of clipped convex functions ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ Travelling salesman problem in tissue P systems with costs ⋮ Finding Hamiltonian circuits in quasi-adjoint graphs ⋮ Approximate Dynamic Programming based on High Dimensional Model Representation ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ Finding the longest isometric cycle in a graph ⋮ Hitting subgraphs in \(P_4\)-tidy graphs ⋮ On the integrality ratio of the subtour LP for Euclidean TSP ⋮ Real-time solving of computationally hard problems using optimal algorithm portfolios ⋮ Continuous relaxations for the traveling salesman problem ⋮ Efficient Network Dismantling via Node Explosive Percolation* ⋮ Finding a tree structure in a resolution proof is NP-complete ⋮ Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ Unnamed Item
This page was built for publication: Reducibility Among Combinatorial Problems
