DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Set packing
Set packing
Selective Maximum Coverage and Set Packing
Exact Algorithms and APX-Hardness Results for Geometric Packing and Covering Problems∗
Reductions and Satisfiability
8. NP and Computational Intractability
Generalized Sphere-Packing and Sphere-Covering Bounds on the Size
Packing Triangles in Low Degree Graphs and Indifference Graphsଁ Gordana Mani´C∗, Yoshiko Wakabayashi
Set Packing Partitioning and Covering
NP-Completeness Proofs
Online Set Packing and Competitive Scheduling of Multi-Part Tasks
On the Complexity of Approximating K-Set Packing *
Solving the Set Cover Problem and the Problem of Exact Cover by 3-Sets In
NP Completeness Part 2
Models and Algorithms for Solving Packing Problems in Logistics
Generalized Sphere-Packing Upper Bounds on the Size of Codes for Combinatorial Channels
Polynomial-Time Reductions Contents
18.2 Set Packing 625
The Proof Is in the Pudding a Look at the Changing Nature of Mathematical Proof
Bin Packing with Fragmentable Items: Presentation and Approximations Bertrand Lecun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser
Top View
Open Huiwenyu-Dissertation.Pdf
8. NP and Computational Intractability Algorithmic Design Patterns
Improved Approximation for 3-Dimensional Matching Via
18.1 Set Cover 621
A Different Perspective for Approximating Max Set Packing
A Heuristic Algorithm for the Bin Packing Problem with Conflicts On
Survey of Approximation Algorithms for Set Cover Problem
Title Nonlinear Programming Based Algorithms to Cutting and Packing
Combinatorial Optimization: Packing and Covering
The Pencil Packing Problem∗
Solution Techniques for Specific Bin Packing Problems with Applications to Assembly Line Optimization