Hardness and approximation of submodular minimum linear ordering problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A note on the generalized min-sum set cover problem
On optimal linear arrangements of trees
An improved approximation ratio for the minimum linear arrangement problem
\(\ell ^2_2\) spreading metrics for vertex ordering problems
Single machine precedence constrained scheduling is a Vertex cover problem
Efficient bounds for the stable set, vertex cover and set packing problems
The principal lattice of partitions of a submodular function
The boundaries of submodular functions
Profile minimization problem for matrices and graphs
Fractional dimension of partial orders
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Approximating min sum set cover
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Preemptive and non-preemptive generalized min sum set cover
Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
A projected gradient algorithm for solving the maxcut SDP relaxation
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Theory of Principal Partitions Revisited
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
Iterative Methods in Combinatorial Optimization
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Approximating Minimum Linear Ordering Problems
Matroids and Graphs
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
A Minimum Linear Arrangement Algorithm for Undirected Trees
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
New Approximation Techniques for Some Linear Ordering Problems
On Submodular Search and Machine Scheduling
Optimal Long Code Test with One Free Bit
Multiple intents re-ranking
Single-Machine Scheduling with Precedence Constraints
On the Complexity of Some Enumeration Problems for Matroids
Algorithms – ESA 2005
Optimal Assignments of Numbers to Vertices
LINEAR LAYOUT OF GENERALIZED HYPERCUBES
On the complexity of \(k\)-SAT

This page was built for publication: Hardness and approximation of submodular minimum linear ordering problems

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