A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem

1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating minimum number of guards on the terrain ( T ) to cover/guard the whole terrain is known as 1.5D terrain guarding problem. Approximation algorithms and a polynomial-time approximation scheme have been presented for...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 254; číslo 1-2; s. 37 - 46
Hlavní autor:	Elis, Haluk
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2017 Springer Springer Nature B.V
Témata:	Algorithms Approximation Business and Management Combinatorics Convex functions Estimating techniques Guards Integer programming Location analysis Mathematical analysis Mathematical research Operations research Operations Research/Decision Theory Original Paper Ratios Satellites Studies Terrain Theory of Computation Finite dominating sets Terrain guarding problem Zero-one integer programming Location
ISSN:	0254-5330, 1572-9338
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!