Algorithms – ESA 2005
From MaRDI portal
Publication:5475855
DOI10.1007/11561071zbMath1162.68822OpenAlexW2501059503MaRDI QIDQ5475855
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
Safe Approximation and Its Relation to Kernelization, FO model checking on geometric graphs, Twin-width II: small classes, Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes, Consensus Patterns (Probably) Has no EPTAS, Linear-Time Approximation Algorithms for Unit Disk Graphs, On the parameterized complexity of \(d\)-dimensional point set pattern matching, Unique Covering Problems with Geometric Sets, Fixed-parameter tractability and lower bounds for stabbing problems, Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}, The parameterized hardness of the \(k\)-center problem in transportation networks, On approximating string selection problems with outliers, Computing list homomorphisms in geometric intersection graphs, Temporal interval cliques and independent sets, Structural parameters, tight bounds, and approximation for \((k, r)\)-center, Computational complexity for the problem of optimal intersection of straight line segments by disks, Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs, Shifting strategy for geometric graphs without geometry, Parameterized complexity of induced graph matching on claw-free graphs, Dispersing and grouping points on planar segments, A unified model and algorithms for temporal map labeling, Minimum vertex cover in rectangle graphs, Parameterized approximation algorithms for some location problems in graphs, On the parameterized complexity of multiple-interval graph problems, Fractal dimension and lower bounds for geometric problems, Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Parameterized complexity of geometric covering problems having conflicts, Unnamed Item, On some matching problems under the color-spanning model, Exact multi-covering problems with geometric sets, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, The Parameterized Hardness of the k-Center Problem in Transportation Networks, Finding, hitting and packing cycles in subexponential time on unit disk graphs, Unnamed Item, A tight analysis of geometric local search
