scientific article; zbMATH DE number 1953201
From MaRDI portal
Publication:4414647
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Complexity and approximation results on the shared transportation problem
- On the shared transportation problem: computational hardness and exact approach
- A hybrid exact algorithm for complete set partitioning
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
- Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
- Partition into triangles on bounded degree graphs
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring
- In memoriam: Gerhard Woeginger (1964--2022)
- Concerning infeasibility of the wave functions of the universe
- A complexity and approximation framework for the maximization scaffolding problem
- New Computational Paradigms
- Parallel family trees for transfer matrices in the Potts model
- Solving the job-shop scheduling problem optimally by dynamic programming
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- On comparing algorithms for the maximum clique problem
- An exact algorithm for the minimum dominating clique problem
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Parameterized algorithmics for linear arrangement problems
- Width-parametrized SAT: time-space tradeoffs
- Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
- Strong partial clones and the time complexity of SAT problems
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Exact Algorithms for Edge Domination
- Solving NP-Complete Problems with Quantum Search
- Faster exact solutions for some NP-hard problems.
- A heuristic approach for the max-min diversity problem based on max-clique
- scientific article; zbMATH DE number 3915621 (Why is no real title available?)
- Branch and recharge: exact algorithms for generalized domination
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
- Collective dynamics of phase-repulsive oscillators solves graph coloring 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)
