On the parallel solution of set covering and set partitioning problems

Arunabha Sen, Loretta Goldberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper describes the development, implementation, and evaluation of parallel algorithms for solving set covering and set partitioning problems. Existing algorithms for these NP-complete problems can not always determine an optimal solution for a problem instance in a reasonable amount of time. While the use of parallel processing is not expected to alleviate the suspected intractability of these problems, it is hoped that we will be able to obtain optimal solutions to many more real world problems as the result of parallel processing. The computational results described in mis paper were obtained using a 32 node Intel iPSC/2 hypercube system.

Original languageEnglish (US)
Title of host publicationConference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992
PublisherIEEE Computer Society
Pages908-914
Number of pages7
ISBN (Electronic)0818631600
DOIs
StatePublished - Jan 1 1992
Event26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992 - Pacific Grove, United States
Duration: Oct 26 1992Oct 28 1992

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Conference

Conference26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992
CountryUnited States
CityPacific Grove
Period10/26/9210/28/92

Fingerprint

Processing
Parallel algorithms
Computational complexity

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

Sen, A., & Goldberg, L. (1992). On the parallel solution of set covering and set partitioning problems. In Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992 (pp. 908-914). [269088] (Conference Record - Asilomar Conference on Signals, Systems and Computers). IEEE Computer Society. https://doi.org/10.1109/ACSSC.1992.269088

On the parallel solution of set covering and set partitioning problems. / Sen, Arunabha; Goldberg, Loretta.

Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992. IEEE Computer Society, 1992. p. 908-914 269088 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A & Goldberg, L 1992, On the parallel solution of set covering and set partitioning problems. in Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992., 269088, Conference Record - Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society, pp. 908-914, 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992, Pacific Grove, United States, 10/26/92. https://doi.org/10.1109/ACSSC.1992.269088
Sen A, Goldberg L. On the parallel solution of set covering and set partitioning problems. In Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992. IEEE Computer Society. 1992. p. 908-914. 269088. (Conference Record - Asilomar Conference on Signals, Systems and Computers). https://doi.org/10.1109/ACSSC.1992.269088
Sen, Arunabha ; Goldberg, Loretta. / On the parallel solution of set covering and set partitioning problems. Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992. IEEE Computer Society, 1992. pp. 908-914 (Conference Record - Asilomar Conference on Signals, Systems and Computers).
@inproceedings{0383fc5726cb4d22ad73b0362f97e16b,
title = "On the parallel solution of set covering and set partitioning problems",
abstract = "This paper describes the development, implementation, and evaluation of parallel algorithms for solving set covering and set partitioning problems. Existing algorithms for these NP-complete problems can not always determine an optimal solution for a problem instance in a reasonable amount of time. While the use of parallel processing is not expected to alleviate the suspected intractability of these problems, it is hoped that we will be able to obtain optimal solutions to many more real world problems as the result of parallel processing. The computational results described in mis paper were obtained using a 32 node Intel iPSC/2 hypercube system.",
author = "Arunabha Sen and Loretta Goldberg",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/ACSSC.1992.269088",
language = "English (US)",
series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",
pages = "908--914",
booktitle = "Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992",

}

TY - GEN

T1 - On the parallel solution of set covering and set partitioning problems

AU - Sen, Arunabha

AU - Goldberg, Loretta

PY - 1992/1/1

Y1 - 1992/1/1

N2 - This paper describes the development, implementation, and evaluation of parallel algorithms for solving set covering and set partitioning problems. Existing algorithms for these NP-complete problems can not always determine an optimal solution for a problem instance in a reasonable amount of time. While the use of parallel processing is not expected to alleviate the suspected intractability of these problems, it is hoped that we will be able to obtain optimal solutions to many more real world problems as the result of parallel processing. The computational results described in mis paper were obtained using a 32 node Intel iPSC/2 hypercube system.

AB - This paper describes the development, implementation, and evaluation of parallel algorithms for solving set covering and set partitioning problems. Existing algorithms for these NP-complete problems can not always determine an optimal solution for a problem instance in a reasonable amount of time. While the use of parallel processing is not expected to alleviate the suspected intractability of these problems, it is hoped that we will be able to obtain optimal solutions to many more real world problems as the result of parallel processing. The computational results described in mis paper were obtained using a 32 node Intel iPSC/2 hypercube system.

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

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

U2 - 10.1109/ACSSC.1992.269088

DO - 10.1109/ACSSC.1992.269088

M3 - Conference contribution

AN - SCOPUS:84933513306

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 908

EP - 914

BT - Conference Record of the 26th Asilomar Conference on Signals, Systems and Computers, ACSSC 1992

PB - IEEE Computer Society

ER -