Algorithms for intersection graphs for t-intervals and t-pseudodisks

DOI10.4086/TOC.2022.V018A018MaRDI QIDQ5093404zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Tanmay Inamdar

Publication date 26 July 2022

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2022.v018a018

zbMATH Keywords

approximation algorithmsdominating setgeometric set coverindependent setmultiple interval graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx) Approximation algorithms (68W25)

Recommendations

• Optimization problems in multiple-interval graphs
• Optimization problems in multiple-interval graphs
• Domination in Geometric Intersection Graphs
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Approximation Algorithms for Geometric Intersection Graphs

This page was built for publication: Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093404)