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

doi 10.1007/978-3-540-69170-9_28
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

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

2002English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

New Clique and Independent Set Algorithms for Circle Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1993English

A PTAS for Subset TSP in Minor-Free Graphs

2020English

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

2019English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

On the Discrete Unit Disk Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy