Pages that link to "Item:Q4386448"

The following pages link to NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448):

Displayed 40 items.

• On approximating string selection problems with outliers (Q391209) ‎ (← links)
• Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) ‎ (← links)
• Shifting strategy for geometric graphs without geometry (Q454249) ‎ (← links)
• On connected domination in unit ball graphs (Q537633) ‎ (← links)
• Minimum vertex cover in rectangle graphs (Q551504) ‎ (← links)
• Polynomial time approximation schemes for minimum disk cover problems (Q613664) ‎ (← links)
• Theory and application of width bounded geometric separators (Q632801) ‎ (← links)
• Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) ‎ (← links)
• Structure of polynomial-time approximation (Q692893) ‎ (← links)
• Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) ‎ (← links)
• MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) ‎ (← links)
• On the complexity of bandwidth allocation in radio networks (Q952444) ‎ (← links)
• Approximating minimum independent dominating sets in wireless networks (Q975555) ‎ (← links)
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) ‎ (← links)
• Large independent sets in random regular graphs (Q1034530) ‎ (← links)
• A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) ‎ (← links)
• A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) ‎ (← links)
• Smooth kinetic maintenance of clusters (Q1775777) ‎ (← links)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) ‎ (← links)
• On-line coloring of geometric intersection graphs (Q1862127) ‎ (← links)
• Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) ‎ (← links)
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) ‎ (← links)
• Approximability of identifying codes and locating-dominating codes (Q2379937) ‎ (← links)
• Improper colouring of (random) unit disk graphs (Q2476286) ‎ (← links)
• Packing triangles in low degree graphs and indifference graphs (Q2476287) ‎ (← links)
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) ‎ (← links)
• Independent set of intersection graphs of convex objects in 2D (Q2489017) ‎ (← links)
• Improper coloring of unit disk graphs (Q3057115) ‎ (← links)
• A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) ‎ (← links)
• Approximation Algorithms for Geometric Intersection Graphs (Q3508563) ‎ (← links)
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) ‎ (← links)
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) ‎ (← links)
• A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) ‎ (← links)
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) ‎ (← links)
• POINT SET LABELING WITH SPECIFIED POSITIONS (Q4818545) ‎ (← links)
• EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) ‎ (← links)
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) ‎ (← links)
• Domination in Geometric Intersection Graphs (Q5458576) ‎ (← links)
• DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS (Q5696901) ‎ (← links)
• (Q5708492) ‎ (← links)