Dual-bounded generating problems: Partial and multiple transversals of a hypergraph

Journal article

Peer reviewed

Endre Boros, Vladimir Gurvich, Leonid Khachiyan and Kazuhisa Makino

SIAM journal on computing, Vol.30(6), pp.2036-2050

2001

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Combinatorics

Combinatorics. Ordered structures

Computer science; control theory; systems

Exact sciences and technology

Graph theory

Mathematics

Sciences and techniques of general use

Theoretical computing

12 Record Views

Title: Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
Creators: Endre Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Vladimir Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, United States
Leonid Khachiyan - Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854, United States
Kazuhisa Makino - Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531, Japan
Publication Details: SIAM journal on computing, Vol.30(6), pp.2036-2050
Date published: 2001
Publisher: Society for Industrial and Applied Mathematics
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Journal article
Identifiers: 991031666103804646