Results 1 to 10 of about 95,285 (119)
Verified Approximation Algorithms [PDF]
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing.
Robin Eßmann +3 more
doaj +1 more source
Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems
In this work, we investigate a generalization of the classical capacitated arc routing problem, called the Multi-depot Capacitated Arc Routing Problem (MCARP). We give exact and approximation algorithms for different variants of the MCARP.
Wei Yu, Yujie Liao, Yichen Yang
doaj +1 more source
A simple greedy approximation algorithm for the unit disk cover problem [PDF]
Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algorithm
Mahdi Imanparast, Seyed Naser Hashemi
doaj +1 more source
An overview on polynomial approximation of NP-hard problems [PDF]
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
Decomposition of the Knapsack Problem for Increasing the Capacity of Operating Rooms
This paper is aimed at the problem of scheduling surgeries in operating rooms. To solve this problem, we suggest using some variation of the bin packing problem. The model is based on the actual operation of 10 operating rooms, each of which belongs to a
Alexander Alekseevich Lazarev +2 more
doaj +1 more source
Approximation Algorithms for Multitasking Scheduling Problems
In this work, we incorporate human factors and real-life operations into newly proposed multitasking scheduling problems with periodic shift activities.
Feifeng Zheng +3 more
doaj +1 more source
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann +3 more
doaj +1 more source
Greedy Algorithms for Optimal Distribution Approximation
The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj +1 more source
Pade Method for Construction of Numerical Algorithms for Fractional Initial Value Problem
In this paper, we propose an efficient method for constructing numerical algorithms for solving the fractional initial value problem by using the Pade approximation of fractional derivative operators. We regard the Grunwald–Letnikov fractional derivative
Feng Gao, Chunmei Chi
doaj +1 more source
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source

