scientific article; zbMATH DE number 910871
From MaRDI portal
Publication:4886045
zbMath0847.90136MaRDI QIDQ4886045
Publication date: 28 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (54)
Approximation algorithms for NMR spectral peak assignment. ⋮ Traveling salesman problems in temporal graphs ⋮ Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs ⋮ Improved Approximation Algorithms for Weighted 2-Path Partitions ⋮ On spectrum sharing games ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ On sorting unsigned permutations by double-cut-and-joins ⋮ Approximation of Constraint Satisfaction via local search ⋮ Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) ⋮ An Improved Approximation Bound for Spanning Star Forest and Color Saving ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs ⋮ The limits of local search for weighted \(k\)-set packing ⋮ Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs ⋮ Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks ⋮ Approximation algorithms for a genetic diagnostics problem ⋮ A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations ⋮ Unnamed Item ⋮ Flexible coloring ⋮ Uniform unweighted set cover: the power of non-oblivious local search ⋮ A 6/5-approximation algorithm for the maximum 3-cover problem ⋮ Improved approximation algorithms for weighted 2-path partitions ⋮ Tractability and approximability of maximal strip recovery ⋮ A better differential approximation ratio for symmetric TSP ⋮ Hardness of approximation for non-overlapping local alignments. ⋮ Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs ⋮ A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling ⋮ Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes ⋮ Dual parameterization of Weighted Coloring ⋮ Tractability and Approximability of Maximal Strip Recovery ⋮ Approximating k-set cover and complementary graph coloring ⋮ On finding augmenting graphs ⋮ Competitive algorithms for multistage online scheduling ⋮ Approximation algorithms for maximum two-dimensional pattern matching ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem ⋮ An approximation algorithm for maximum triangle packing ⋮ A modified greedy algorithm for dispersively weighted 3-set cover ⋮ On approximating minimum vertex cover for graphs with perfect matching ⋮ Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem ⋮ Improved Algorithm for Maximum Independent Set on Unit Disk Graph ⋮ Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) ⋮ On the solution bound of two-sided scaffold filling ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ A randomized approximation algorithm for metric triangle packing ⋮ A local search algorithm for binary maximum 2-path partitioning ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Parameterized inapproximability of independent set in \(H\)-free graphs ⋮ Hierarchically specified unit disk graphs ⋮ Differential approximation algorithms for some combinatorial optimization problems ⋮ Dual parameterization of weighted coloring ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Distributed algorithms for matching in hypergraphs
This page was built for publication:
