Titlebook: WALCOM: Algorithms and Computation; 7th International Wo Subir Kumar Ghosh,Takeshi Tokuyama Conference proceedings 2013 Springer-Verlag Ber

Eviction

Parley

A Novel Efficient Approach for Solving the Art Gallery ProblemThe AGP is known to be NP-hard even for very restricted special cases. This paper describes a primal-dual algorithm based on continuous optimization techniques for solving large-scale instances of the Art Gallery Problem. More precisely, the algorithm is a combination of methods from computational g

青春期

Fixed-Orientation Equilateral Triangle Matching of Point Setsd only if there is some . containing both . and . but no other points from .. We study ..(.) graphs where ∇ is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the .-axis and the corner opposite to this side below that side). For point sets i

FRET

airborne

Online Exploration and Triangulation in Orthogonal Polygonal Regionsygonal region ., the Online Minimum Relay Triangulation Problem (OMRTP) asks for an exploration strategy that maintains a triangulation with limited edge length and achieves a minimum number of robots (relays), such that the triangulation covers .; for a given number . of robots, the Online Maximum

OFF

意外的成功

A Competitive Strategy for Distance-Aware Online Shape Allocationon .. of previously unassigned area .. in .. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set ... Related location problems have received a considerable amount of attention; in part

不如屎壳郎

A Competitive Strategy for Distance-Aware Online Shape Allocationon .. of previously unassigned area .. in .. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set ... Related location problems have received a considerable amount of attention; in part

GORGE

Base Location Problems for Base-Monotone Regionsn pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating . baselines in a given . ×. pixe

circumvent

Base Location Problems for Base-Monotone Regionsn pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating . baselines in a given . ×. pixe