Pages that link to "Item:Q922700"

The following pages link to Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700):

Displaying 50 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
• Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
• Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
• The minimum feasible tileset problem (Q666670) (← links)
• Alignment of trees -- an alternative to tree edit (Q673642) (← links)
• Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Hardness and approximation of traffic grooming (Q837166) (← links)
• Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
• Complexity issues in color-preserving graph embeddings (Q846361) (← links)
• Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
• Partitioning a weighted partial order (Q927191) (← links)
• Exact algorithms for the matrix bid auction (Q958442) (← links)
• Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
• On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
• An improved randomized approximation algorithm for maximum triangle packing (Q1028142) (← links)
• Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
• Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
• The hardness of approximation: Gap location (Q1332662) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
• Distributed backup placement in networks (Q1741963) (← links)
• Order consolidation for batch processing (Q1774533) (← links)
• Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
• Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• Packing triangles in bounded degree graphs. (Q1853132) (← links)
• Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
• Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
• A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
• Generalized budgeted submodular set function maximization (Q2051778) (← links)
• An improved approximation algorithm for the minimum common integer partition problem (Q2051801) (← links)
• Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
• Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games (Q2125490) (← links)
• Computing envy-freeable allocations with limited subsidies (Q2152144) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
• The power of one evil secret agent (Q2196556) (← links)
• Independent sets in Line of Sight networks (Q2201775) (← links)
• Strongly budget balanced auctions for multi-sided markets (Q2238720) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• The hypergraph assignment problem (Q2339846) (← links)