scientific article; zbMATH DE number 1953201
From MaRDI portal
Publication:4414647
Recommendations
Cited in
(only showing first 100 items - show all)- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Fast algorithms for max independent set
- When polynomial approximation meets exact computation
- Improved worst-case complexity for the MIN 3-SET COVERING problem
- A fixed-parameter tractability result for multicommodity demand flow in trees
- Solving connected dominating set faster than \(2^n\)
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
- Exact algorithms for counting 3-colorings of graphs
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- An exact algorithm for the Boolean connectivity problem for k-CNF
- Recovery of signals from unordered partial frame coefficients
- The traveling salesman problem with few inner points
- A new taxonomy of global optimization algorithms
- Parameterized complexity and subexponential-time computability
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- Nondeterministic graph searching: from pathwidth to treewidth
- Computing in combinatorial optimization
- Parameterized modal satisfiability
- Exact algorithms for maximum independent set
- Improving efficiency of 3-SAT-solving tile systems
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- When polynomial approximation meets exact computation
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
- Exact Algorithms for Generalized Combinatorial Optimization Problems
- Exact algorithms for problems related to the densest \(k\)-set problem
- An initial study of time complexity in infinite-domain constraint satisfaction
- Exact algorithms for edge domination
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
- Iterative compression and exact algorithms
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Moderate exponential-time algorithms for scheduling problems
- Moderately exponential approximation for makespan minimization on related machines
- On an extension of the Sort \& Search method with application to scheduling theory
- Fixed-parameter tractability and data reduction for multicut in trees
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- An improved exact algorithm for TSP in graphs of maximum degree 4
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- An introduction to exponential time exact algorithms for solving NP-hard problems
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- scientific article; zbMATH DE number 7559154 (Why is no real title available?)
- Finding a dominating set on bipartite graphs
- On exponential time lower bound of Knapsack under backtracking
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- A note on the eternal dominating set problem
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Exact exponential algorithms.
- Finding and enumerating Hamilton cycles in 4-regular graphs
- Exact algorithms for dominating set
- Tree decomposition and discrete optimization problems: a survey
- An improved exact algorithm for the domatic number problem
- A note on exact algorithms for vertex ordering problems on graphs
- Faster Exact Bandwidth
- Cluster editing with locally bounded modifications
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Partition into triangles on bounded degree graphs
- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- Locally consistent constraint satisfaction problems
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Open problems around exact algorithms
- Comparing problem solving strategies for NP-hard optimization problems
- Covering moving points with anchored disks
- Exact algorithms for exact satisfiability and number of perfect matchings
- Tight lower bounds for certain parameterized NP-hard problems
- Multi-objective power distribution optimization using NSGA-II
- Complexity issues in color-preserving graph embeddings
- On maximum independent sets in \(P_{5}\)-free graphs
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- Reformulation of global constraints based on constraints checkers
- MP or not MP: that is the question
- Strong triadic closure in cographs and graphs of low maximum degree
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Treewidth computation and extremal combinatorics
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Efficiency in exponential time for domination-type problems
- Computational Short Cuts in Infinite Domain Constraint Satisfaction
- Dual parameterization and parameterized approximability of subset graph problems
- Optimal 2-constraint satisfaction via sum-product algorithms
- Bicolored independent sets and bicliques
- On two techniques of combining branching and treewidth
- Sort and Search: exact algorithms for generalized domination
- scientific article; zbMATH DE number 1405801 (Why is no real title available?)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
- On the complexity of scaffolding problems: from cliques to sparse graphs
- Efficient 3-SAT algorithms in the tile assembly model
- Computing branchwidth via efficient triangulations and blocks
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
- Robust combinatorial optimization with locally budgeted uncertainty
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Vertex coloring of a graph for memory constrained scenarios
- On optimal approximability results for computing the strong metric dimension
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- Faster exponential-time algorithms in graphs of bounded average degree
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- A ``maximum node clustering problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414647)
