Minimax problems with bitonic matrices

DOI10.1002/NET.10038zbMATH Open1020.90046OpenAlexW1998788630MaRDI QIDQ4785227FDOQ4785227

Authors: Dorit S. Hochbaum, P. A. Tucker 

Publication date: 17 December 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10038

Recommendations

• scientific article; zbMATH DE number 3906215
• scientific article; zbMATH DE number 3914086
• Absolute bounds on optimal cost for a class of set covering problems
• On the facial structure of the set covering polytope
• Computer Solutions to Minimum-Cover Problems

zbMATH Keywords

minimaxshortest pathsset coverPQ-treeminimum-cost network flowconsecutive 1's constraintsbitonic propertycircular 1's

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Minimax problems in mathematical programming (90C47)

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited In (2)

• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• Minimum ratio cover of matrix columns by extreme rays of its induced cone

This page was built for publication: Minimax problems with bitonic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785227)