Pages that link to "Item:Q4999425"

The following pages link to Reducibility among Combinatorial Problems (Q4999425):

Displaying 50 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals (Q256536) (← links)
• Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
• Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
• Parameterizations of test cover with bounded test sizes (Q261370) (← links)
• Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
• Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
• Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
• Guessing games on triangle-free graphs (Q278884) (← links)
• Minimum maximum reconfiguration cost problem (Q279831) (← links)
• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
• On the directed cut cone and polytope (Q281821) (← links)
• The online knapsack problem with incremental capacity (Q283993) (← links)
• Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
• A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
• Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
• Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
• Judicious partitions of weighted hypergraphs (Q295108) (← links)
• Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
• Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
• Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
• A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
• Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
• On determining if tree-based networks contain fixed trees (Q309890) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• Hamilton cycles in almost distance-hereditary graphs (Q317825) (← links)
• An efficient two-stage algorithm for decentralized scheduling of micro-CHP units (Q319702) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
• Solving hard control problems in voting systems via integer programming (Q322433) (← links)
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
• An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
• Totally optimal decision trees for Boolean functions (Q323025) (← links)
• Well-covered triangulations. IV (Q323041) (← links)
• NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
• Computational complexity of manipulation: a survey (Q334204) (← links)
• The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
• Scheduling with compressible and stochastic release dates (Q336364) (← links)
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
• Ambulance routing for disaster response with patient groups (Q337463) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)