A faster FPTAS for counting two-rowed contingency tables

Tzvi Alon; Nir Halman

doi:10.1016/j.dam.2020.05.036

A faster FPTAS for counting two-rowed contingency tables

Tzvi Alon
, Nir Halman

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

Abstract

In this paper we provide a deterministic fully polynomial time approximation scheme (FPTAS) for counting two-rowed contingency tables that is faster than any either deterministic or randomized approximation scheme for this problem known to date. Our FPTAS is derived via a somewhat sophisticated usage of the method of K-approximation sets and functions introduced by Halman et al. (2009).

Original language	English
Pages (from-to)	161-170
Number of pages	10
Journal	Discrete Applied Mathematics
Volume	303
DOIs	https://doi.org/10.1016/j.dam.2020.05.036
State	Published - 15 Nov 2021
Externally published	Yes

Keywords

Contingency tables
Dynamic programming
K-approximation sets and functions

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2020.05.036

Cite this

@article{0feb90903c734d9cb31d96d41e016f3a,

title = "A faster FPTAS for counting two-rowed contingency tables",

abstract = "In this paper we provide a deterministic fully polynomial time approximation scheme (FPTAS) for counting two-rowed contingency tables that is faster than any either deterministic or randomized approximation scheme for this problem known to date. Our FPTAS is derived via a somewhat sophisticated usage of the method of K-approximation sets and functions introduced by Halman et al. (2009).",

keywords = "Contingency tables, Dynamic programming, K-approximation sets and functions",

author = "Tzvi Alon and Nir Halman",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = nov,

day = "15",

doi = "10.1016/j.dam.2020.05.036",

language = "English",

volume = "303",

pages = "161--170",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A faster FPTAS for counting two-rowed contingency tables

AU - Alon, Tzvi

AU - Halman, Nir

PY - 2021/11/15

Y1 - 2021/11/15

N2 - In this paper we provide a deterministic fully polynomial time approximation scheme (FPTAS) for counting two-rowed contingency tables that is faster than any either deterministic or randomized approximation scheme for this problem known to date. Our FPTAS is derived via a somewhat sophisticated usage of the method of K-approximation sets and functions introduced by Halman et al. (2009).

AB - In this paper we provide a deterministic fully polynomial time approximation scheme (FPTAS) for counting two-rowed contingency tables that is faster than any either deterministic or randomized approximation scheme for this problem known to date. Our FPTAS is derived via a somewhat sophisticated usage of the method of K-approximation sets and functions introduced by Halman et al. (2009).

KW - Contingency tables

KW - Dynamic programming

KW - K-approximation sets and functions

UR - https://www.scopus.com/pages/publications/85086711545

U2 - 10.1016/j.dam.2020.05.036

DO - 10.1016/j.dam.2020.05.036

M3 - Article

SN - 0166-218X

VL - 303

SP - 161

EP - 170

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

A faster FPTAS for counting two-rowed contingency tables

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this