scientific article
From MaRDI portal
Publication:3337223
zbMath0545.90074MaRDI QIDQ3337223
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (41)
Safe Approximation and Its Relation to Kernelization ⋮ An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs ⋮ Introduction to QUBO ⋮ Autarkies and Persistencies for QUBO ⋮ On the multi-radius cover problem ⋮ Node-weighted Steiner tree approximation in unit disk graphs ⋮ A 2-approximation NC algorithm for connected vertex cover and tree cover ⋮ Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation ⋮ On a generalization of Nemhauser and Trotter's local optimization theorem ⋮ A primal-dual approximation algorithm for partial vertex cover: Making educated guesses ⋮ A primal-dual approximation algorithm for \textsc{minsat} ⋮ Using fractional primal-dual to schedule split intervals with demands ⋮ Approximation for vertex cover in \(\beta\)-conflict graphs ⋮ PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs ⋮ Vertex cover in conflict graphs ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs ⋮ Exploiting locality: Approximating sorting buffers ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Distributed approximation of \(k\)-service assignment ⋮ Bandwidth allocation in cellular networks with multiple interferences ⋮ Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut ⋮ Admission control with advance reservations in simple networks ⋮ Randomized approximation of bounded multicovering problems ⋮ A bounded approximation for the minimum cost 2-sat problem ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ An approximation of the minimum vertex cover in a graph ⋮ Reoptimization of Weighted Graph and Covering Problems ⋮ A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem ⋮ Semi-streaming algorithms for submodular matroid intersection ⋮ Flexible allocation on related machines with assignment restrictions ⋮ Combinatorial algorithms for feedback problems in directed graphs ⋮ Semi-streaming algorithms for submodular matroid intersection ⋮ Resource allocation in bounded degree trees ⋮ A new approach for approximating node deletion problems ⋮ Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs ⋮ A Primal-Dual Method for Approximating Tree Cover with Two Weights ⋮ The maximum clique problem
This page was built for publication:
