scientific article; zbMATH DE number 7051259
From MaRDI portal
zbMath1423.90216MaRDI QIDQ4633902
Julia Chuzhoy, Parinya Chalermsook
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496867
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Lagrangean decomposition for the maximum independent set problem applied to map labeling, Improved algorithms for resource allocation under varying capacity, Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract), A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem, Approximation algorithms on consistent dynamic map labeling, Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve, Mixed Map Labeling, A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing, Optimization problems in dotted interval graphs, Geometric Packing under Nonuniform Constraints, Keep your distance: land division with separation, Approximation algorithms for free-label maximization, Unnamed Item, Winner determination in geometrical combinatorial auctions, Approximation algorithms for maximum independent set of pseudo-disks, Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking, A note on fractional coloring and the integrality gap of LP for maximum weight independent set, Matching colored points with rectangles, Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams., A Tight (3/2+ε) Approximation for Skewed Strip Packing., Anchored rectangle and square packings, On Wegner's inequality for axis-parallel rectangles, Minimum vertex cover in rectangle graphs, Independent sets and hitting sets of bicolored rectangular families, Near-linear algorithms for geometric hitting sets and set covers, Submodular unsplittable flow on trees, Computing maximum independent set on outerstring graphs and their relatives, Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, Minimum point-overlap labelling*, Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity, Stochastic makespan minimization in structured set systems
