Approximation and Online Algorithms
From MaRDI portal
Publication:5896939
DOI10.1007/b95598zbMath1213.68446OpenAlexW4300520713MaRDI QIDQ5896939
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Computing list homomorphisms in geometric intersection graphs ⋮ Unnamed Item ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ Note on coloring of double disk graphs ⋮ Computing a maximum clique in geometric superclasses of disk graphs ⋮ Unnamed Item ⋮ \( L ( 2 , 1 )\)-labeling of disk intersection graphs
This page was built for publication: Approximation and Online Algorithms