Approximating Minimum Linear Ordering Problems

DOI10.1007/978-3-642-32512-0_18zbMath1372.68300OpenAlexW1527357347MaRDI QIDQ3167397

Satoru Iwata, Pushkar Tripathi, Prasad Tetali

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_18

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

A General Framework for Approximating Min Sum Ordering Problems ⋮ On Submodular Search and Machine Scheduling

This page was built for publication: Approximating Minimum Linear Ordering Problems