- Maximizing Non-monotone Submodular Set Functions Subject to Different\n Constraints: Combined Algorithms
2011/01/15 by Salman Fadaei, MohammadAmin Fazli, Fadaei, Salman +3 · 1 citation
Computer Science · Mathematics · #Algorithm #Approximation algorithm #Cardinality (data modeling) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constraint (computer-aided design) #Continuous knapsack problem #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Discrete mathematics #FOS: Computer and information sciences #Function (biology) #Greedy algorithm #Knapsack problem #Mathematical optimization #Mathematics #Matroid #Maximization #Monotone polygon #Optimization and Search Problems #Polytope #Set (abstract data type) #Set function #Submodular set function #cs.DS
- Saving space by algebraization
2010/06/05 by Daniel Lokshtanov, Jesper Nederlof · 2 citations
Computer Science · Mathematics · #Constraint Satisfaction and Optimization #Complexity and Algorithms in Graphs #Algorithms and Data Compression #Knapsack problem #Time complexity #Polynomial #Mathematics #Polynomial-time approximation scheme #PSPACE #Space (punctuation) #Continuous knapsack problem #Matrix polynomial #Reciprocal polynomial #Discrete mathematics #Combinatorics #Computational complexity theory #Algebra over a field #Computer science #Algorithm #Pure mathematics #Mathematical analysis