Pages that link to "Item:Q4299299"
From MaRDI portal
The following pages link to Approximation algorithms for NP-complete problems on planar graphs (Q4299299):
Displaying 50 items.
- Improving robustness of next-hop routing (Q266050) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Minors and dimension (Q345115) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Dynamic graph-based search in unknown environments (Q414464) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
