scientific article; zbMATH DE number 910871
From MaRDI portal
zbMATH Open0847.90136MaRDI QIDQ4886045FDOQ4886045
Authors: Magnús M. Halldórsson 
Publication date: 28 July 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (59)
- A deterministic approximation algorithm for metric triangle packing
- An improved approximation algorithm for metric triangle packing
- Parameterized inapproximability of independent set in \(H\)-free graphs
- The limits of local search for weighted \(k\)-set packing
- Packing \(K_r\)s in bounded degree graphs
- Title not available (Why is that?)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- Flexible coloring
- Tractability and approximability of maximal strip recovery
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
- A randomized approximation algorithm for metric triangle packing
- Traveling salesman problems in temporal graphs
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- On spectrum sharing games
- Approximate multi-matroid intersection via iterative refinement
- On approximating minimum vertex cover for graphs with perfect matching
- Dual parameterization of Weighted Coloring
- A better differential approximation ratio for symmetric TSP
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- The limits of local search for weighted \(k\)-set packing
- Improved Approximation Algorithms for Weighted 2-Path Partitions
- Differential approximation algorithms for some combinatorial optimization problems
- Hierarchically specified unit disk graphs
- On finding augmenting graphs
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Tractability and approximability of maximal strip recovery
- Probabilistic graph-coloring in bipartite and split graphs
- Competitive algorithms for multistage online scheduling
- Hardness of approximation for non-overlapping local alignments.
- Approximation algorithms for a genetic diagnostics problem
- Approximation algorithms for maximum two-dimensional pattern matching
- Dual parameterization of weighted coloring
- On the solution bound of two-sided scaffold filling
- An approximation algorithm for maximum triangle packing
- A modified greedy algorithm for dispersively weighted 3-set cover
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Approximation algorithms for NMR spectral peak assignment.
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Approximating k-set cover and complementary graph coloring
- Uniform unweighted set cover: the power of non-oblivious local search
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- A 6/5-approximation algorithm for the maximum 3-cover problem
- Distributed algorithms for matching in hypergraphs
- Approximation of Constraint Satisfaction via local search
- On sorting unsigned permutations by double-cut-and-joins
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- A local search algorithm for binary maximum 2-path partitioning
- On linear and semidefinite programming relaxations for hypergraph matching
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- Improved approximation algorithms for weighted 2-path partitions
- 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
- Title not available (Why is that?)
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 Q4886045)
