Locally defined independence systems on graphs

DOI10.1016/j.dam.2022.11.001OpenAlexW4310195200MaRDI QIDQ2109105

Yuki Amano

Publication date: 20 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10003

zbMATH Keywords

approximation algorithmdegeneracyindependence systemlocal oracle model

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 0-1 timed matching in bipartite temporal graphs
• Matching theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Matroid Matching: The Power of Local Search
• Smallest-last ordering and clustering and graph coloring algorithms
• A Sufficient Condition for Backtrack-Free Search
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• k-Degenerate Graphs
• Approximation and Online Algorithms

This page was built for publication: Locally defined independence systems on graphs