Approximation algorithms in combinatorial scientific computing
type: Item
instance of: scholarly article
title: Approximation algorithms in combinatorial scientific computing
zbMATH Open document ID: 1440.68337
DOI: 10.1017/S0962492919000035
author: Alex Pothen
author: S. M. Ferdous
author: Fredrik Manne
published in: Acta Numerica
publication date: 2019-08-28T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7099163
zbMATH Keywords: approximation algorithms
zbMATH Keywords: degree-constrained subgraphs
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: cardinality matching
zbMATH Keywords: edge-weighted matching
zbMATH Keywords: vertex-weighted matching
zbMATH Keywords: edge-weighted \(b\)-matching, weighted edge cover
zbMATH Keywords: \(b\)-edge cover
describes a project that uses: SparseMatrix
describes a project that uses: Blossom V
describes a project that uses: Matchbox
describes a project that uses: SuperLU-DIST
describes a project that uses: LEDA
describes a project that uses: Modelica
describes a project that uses: LEMON
describes a project that uses: WebGraph
describes a project that uses: BUbiNG
MaRDI profile type: MaRDI publication profile
cites work: The two possible values of the chromatic number of a random graph
cites work: Q4288579
cites work: A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
cites work: A polynomial algorithm for b-matchings: An alternative approach
cites work: A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
cites work: Matching algorithms are fast in sparse random graphs
cites work: Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
cites work: Assignment Problems
cites work: Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: The Null Space Problem II. Algorithms
cites work: Predicting fill for sparse orthogonal factorization
cites work: Q3651735
cites work: The university of Florida sparse matrix collection
cites work: On the use of optimal fractional matchings for solving the (integer) matching problem
cites work: Q4426349
cites work: A simple approximation algorithm for the weighted matching problem
cites work: A linear-time approximation algorithm for weighted matchings in graphs
cites work: Design and analysis of approximation algorithms
cites work: Linear-Time Approximation for Maximum Weight Matching
cites work: On algorithms for permuting large entries to the diagonal of a sparse matrix
cites work: Design, implementation, and analysis of maximum transversal algorithms
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Zero knowledge and the chromatic number
cites work: Data Structures for Weighted Matching and Extensions to b -matching and f -factors
cites work: College Admissions and the Stability of Marriage
cites work: Q3270978
cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
cites work: Solving matching problems with linear programming
cites work: A fast approximation algorithm for the multicovering problem
cites work: Q3002852
cites work: On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
cites work: Pivoting strategies for tough sparse indefinite systems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
cites work: Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
cites work: Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring
cites work: Colouring random graphs
cites work: Efficient approximation algorithms for weighted \(b\)-matching
cites work: A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Distributed algorithms for covering, packing and maximum weighted matching

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: SuperLU_DIST

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q3395507

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Algorithmics of Matching Under Preferences

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Engineering Algorithms for Approximate Weighted Matching

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q3826581

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q4702188

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Online matching and ad allocation

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Some Generalizations of the Problem of Distinct Representatives

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Greedy in Approximation Algorithms

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q4149262

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Average-case analysis of algorithms for matchings and related problems

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Implementing weighted b-matching algorithms

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q3066084

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: An Algorithm for a Minimum Cover of a Graph

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: A new pivoting strategy for Gaussian elimination

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Odd Minimum Cut-Sets and b-Matchings

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Combinatorial algorithms for computing column space bases that have sparse inverses

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Predicting the structure of sparse orthogonal factors

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Computing the block triangular form of a sparse matrix

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q4251057

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Concerning nonnegative matrices and doubly stochastic matrices

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q3680870

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Graph-Based Semi-Supervised Learning

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Q4258215

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: The Design of Approximation Algorithms

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: An analysis of the stable marriage assignment algorithm

Approximation algorithms in combinatorial scientific computing (cites work)
cites work: Computing the Minimum Fill-In is NP-Complete

Approximation algorithms in combinatorial scientific computing (full work available at URL)
full work available at URL: s0962492919000035

Approximation algorithms in combinatorial scientific computing (OpenAlex ID)
OpenAlex ID: W2950905676