The monotone circuit complexity of Boolean functions
Combinatorica
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
Selected papers from the second Krakow conference on Graph theory
Comparability graph augmentation for some multiprocessor scheduling problems
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
An approximation result for a periodic allocation problem
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Dynamic Storage Allocations
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Dynamic Storage Allocation with Known Durations
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Bandwidth Allocation in ATM Networks
IEEE Communications Magazine
| Hi-index | 0.00 |
We study the problem of finding an acyclic orientation of an undirected graph G such that each path is contained in a limited number of maximal cliques of G. In general, in an acyclic oriented graph, each path is contained in more than one maximal cliques. We focus our attention on crown-free interval graphs, and show how to find an acyclic orientation of such a graph, which guarantees that each path is contained in at most four maximal cliques. The proposed technique is used to find approximated solutions for a class of related optimization problems where a solution corresponds to an acyclic orientation of graphs.