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