Set partitioning via inclusion-exclusion
From MaRDI portal
Publication:3558013
Recommendations
Cited in
(only showing first 100 items - show all)- Regular inference as vertex coloring
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- Lower bounds for the graph homomorphism problem
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Counting perfect matchings as fast as Ryser
- Inclusion/exclusion meets measure and conquer
- scientific article; zbMATH DE number 7651213 (Why is no real title available?)
- Enumerating the edge-colourings and total colourings of a regular graph
- Parameterized and exact algorithms for class domination coloring
- An exponential time 2-approximation algorithm for bandwidth
- On exact algorithms for the permutation CSP
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- When polynomial approximation meets exact computation
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- An exact exponential time algorithm for counting bipartite cliques
- Computing hypergraph width measures exactly
- Simplifying Inclusion–Exclusion Formulas
- Fine-grained parameterized complexity analysis of graph coloring problems
- Feedback vertex sets in tournaments
- Fast zeta transforms for lattices with few irreducibles
- A hybrid exact algorithm for complete set partitioning
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Coalition structure generation: a survey
- Computing the chromatic number using graph decompositions via matrix rank
- Trimmed Moebius inversion and graphs of bounded degree
- Multivariate analysis of orthogonal range searching and graph distances
- Notes on tree- and path-chromatic number
- BIPARTITIONING INTO OVERLAPPING SETS
- New Plain-Exponential Time Classes for Graph Homomorphism
- Exponential-time quantum algorithms for graph coloring problems
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Partition into triangles on bounded degree graphs
- Partition into triangles on bounded degree graphs
- Counting Maximal Independent Sets in Subcubic Graphs
- Parameterized pre-coloring extension and list coloring problems
- New potential functions for greedy independence and coloring
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- Tight lower bounds for the complexity of multicoloring
- On the parameterized complexity of compact set packing
- Strong valid inequalities for Boolean logical pattern generation
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
- Sharp separation and applications to exact and parameterized algorithms
- Rural postman parameterized by the number of components of required edges
- On independent sets and bicliques in graphs
- Counting problems in parameterized complexity
- Exact algorithms for counting 3-colorings of graphs
- An initial study of time complexity in infinite-domain constraint satisfaction
- Dual parameterization of weighted coloring
- Solving the train marshalling problem by inclusion-exclusion
- Dual parameterization of weighted coloring
- When polynomial approximation meets exact computation
- The parameterized complexity of the rainbow subgraph problem
- Scheduling partially ordered jobs faster than \(2^n\)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- On the parameterized complexity of b-\textsc{chromatic number}
- The parameterized complexity of the rainbow subgraph problem
- On maximal chain subgraphs and covers of bipartite graphs
- Nonuniform ACC circuit lower bounds
- Families with infants: a general approach to solve hard partition problems
- Solving SCS for bounded length strings in fewer than \(2^n\) steps
- Chromatic kernel and its applications
- New exact algorithms for the 2-constraint satisfaction problem
- Counting independent sets in claw-free graphs
- Assigning channels via the meet-in-the-middle approach
- Exact algorithm for graph homomorphism and locally injective graph homomorphism
- Narrow sieves for parameterized paths and packings
- Fine-grained parameterized complexity analysis of graph coloring problems
- New plain-exponential time classes for graph homomorphism
- NP-completeness results for partitioning a graph into total dominating sets
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- Set multi-covering via inclusion-exclusion
- On partitioning a graph into two connected subgraphs
- Channel assignment via fast zeta transform
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Moderate exponential-time algorithms for scheduling problems
- Decomposition of realizable fuzzy relations
- Moderately exponential time and fixed parameter approximation algorithms
- Why is maximum clique often easy in practice?
- Induced star partition of graphs
- Computing generalized convolutions faster than brute force
- New tools and connections for exponential-time approximation
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- On the complexity of restoring corrupted colorings
- A new genetic algorithm encoding for coalition structure generation problems
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- Parameterized approximation via fidelity preserving transformations
- On the parameterized complexity of compact set packing
- scientific article; zbMATH DE number 7758308 (Why is no real title available?)
- Harmonious coloring: parameterized algorithms and upper bounds
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7
- Finding disjoint paths in networks with star shared risk link groups
- Solving the list coloring problem through a branch-and-price algorithm
- Faster graph coloring in polynomial space
- Invitation to Algorithmic Uses of Inclusion–Exclusion
- Anticoncentration versus the Number of Subset Sums
- Families with infants: speeding up algorithms for NP-hard problems using FFT
- An algorithm for partitioning a set into simple parts
This page was built for publication: Set partitioning via inclusion-exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558013)
