Lower Bounds for Covering Problems

Michael Segal

doi:10.1023/A:1015670603203

Lower Bounds for Covering Problems

Michael Segal

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the 'rotational reduce technique' and well-known lower bound for the maximal gap problem.

Original language	English
Pages (from-to)	17-29
Number of pages	13
Journal	Journal of Mathematical Modelling and Algorithms
Volume	1
Issue number	1
DOIs	https://doi.org/10.1023/A:1015670603203
State	Published - 1 Dec 2002

Keywords

Max-gap problem
lower bounds
reductions

ASJC Scopus subject areas

Modeling and Simulation
Applied Mathematics

Access to Document

10.1023/A:1015670603203

Cite this

@article{d1941760722e44ae9083f7e2bf47f6bc,

title = "Lower Bounds for Covering Problems",

abstract = "In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the 'rotational reduce technique' and well-known lower bound for the maximal gap problem.",

keywords = "Max-gap problem, lower bounds, reductions",

author = "Michael Segal",

year = "2002",

month = dec,

day = "1",

doi = "10.1023/A:1015670603203",

language = "English",

volume = "1",

pages = "17--29",

journal = "Journal of Mathematical Modelling and Algorithms",

issn = "1570-1166",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Lower Bounds for Covering Problems

AU - Segal, Michael

PY - 2002/12/1

Y1 - 2002/12/1

N2 - In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the 'rotational reduce technique' and well-known lower bound for the maximal gap problem.

AB - In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the 'rotational reduce technique' and well-known lower bound for the maximal gap problem.

KW - Max-gap problem

KW - lower bounds

KW - reductions

UR - http://www.scopus.com/inward/record.url?scp=45749085025&partnerID=8YFLogxK

U2 - 10.1023/A:1015670603203

DO - 10.1023/A:1015670603203

M3 - Article

AN - SCOPUS:45749085025

SN - 1570-1166

VL - 1

SP - 17

EP - 29

JO - Journal of Mathematical Modelling and Algorithms

JF - Journal of Mathematical Modelling and Algorithms

IS - 1

ER -

Lower Bounds for Covering Problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this