Pages that link to "Item:Q2768362"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for geometric graphs (Q2768362):
Displaying 26 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- (Q3140432) (← links)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
- On the polytope faces of the graph approximation problem (Q3186827) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Efficient Algorithms for Geometric Graph Search Problems (Q3719850) (← links)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
- (Q4474203) (← links)
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs (Q5317197) (← links)
- (Q5708492) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710802) (← links)
- PTAS for minimum cost multicovering with disks (Q6593767) (← links)
