On Approximate Solutions for Combinatorial Optimization Problems
From MaRDI portal
Publication:3477970
Recommendations
- scientific article; zbMATH DE number 780787
- scientific article; zbMATH DE number 1789921
- scientific article; zbMATH DE number 3873084
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
- Approximability of hard combinatorial optimization problems: an introduction
- scientific article; zbMATH DE number 3873085
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Approximation algorithms for stochastic combinatorial optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
Cited in
(40)- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Property testing of the Boolean and binary rank
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
- Optimal schemes for combinatorial query problems with integer feedback
- Finding approximate solutions to NP-hard problems by neural networks is hard
- Efficient approximation for restricted biclique cover problems
- scientific article; zbMATH DE number 1953193 (Why is no real title available?)
- Chromatic characterization of biclique covers
- Continuous reductions among combinatorial optimization problems
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
- An approximation algorithm for state minimization in 2-MDFAs
- scientific article; zbMATH DE number 4130198 (Why is no real title available?)
- Ultimate greedy approximation of independent sets in subcubic graphs
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Differential approximation algorithms for some combinatorial optimization problems
- Improved approximations for maximum independent set via approximation chains
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Probabilistic graph-coloring in bipartite and split graphs
- Approximate solution of NP optimization problems
- Approximative solutions of best choice problems
- A survey on the structure of approximation classes
- Time slot scheduling of compatible jobs
- scientific article; zbMATH DE number 1789921 (Why is no real title available?)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- The 0-1 inverse maximum stable set problem
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- The approximation of maximum subgraph problems
- Computational aspects of the 2-dimension of partially ordered sets
- Combinatorial optimization with interaction costs: complexity and solvable cases
- On the probabilistic minimum coloring and minimum k-coloring
- scientific article; zbMATH DE number 3873085 (Why is no real title available?)
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
- Sparsification and subexponential approximation
- Structure of polynomial-time approximation
- A portable and scalable algorithm for a class of constrained combinatorial optimization problems
- Reductions, completeness and the hardness of approximability
This page was built for publication: On Approximate Solutions for Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477970)
