Minimax problems with bitonic matrices

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

P. A. Tucker, Dorit S. Hochbaum

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

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 (1)

• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms

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)