Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2018.05.049
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

English

Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs

2002English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs

2020English

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity

2019English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

New Clique and Independent Set Algorithms for Circle Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1993English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

A Bounded Analytic Function in the Unit Disk With a Level Set Component of Infinite Length

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy