5 research outputs found
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
Given an embedded planar acyclic digraph G, we define the problem of "acyclic
hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be
the problem of determining an hamiltonian path completion set of edges such
that, when these edges are embedded on G, they create the smallest possible
number of edge crossings and turn G to a hamiltonian digraph. Our results
include:
--We provide a characterization under which a triangulated st-digraph G is
hamiltonian.
--For an outerplanar triangulated st-digraph G, we define the st-polygon
decomposition of G and, based on its properties, we develop a linear-time
algorithm that solves the Acyclic-HPCCM problem with at most one crossing per
edge of G.
--For the class of st-planar digraphs, we establish an equivalence between
the Acyclic-HPCCM problem and the problem of determining an upward 2-page
topological book embedding with minimum number of spine crossings. We infer
(based on this equivalence) for the class of outerplanar triangulated
st-digraphs an upward topological 2-page book embedding with minimum number of
spine crossings and at most one spine crossing per edge.
To the best of our knowledge, it is the first time that edge-crossing
minimization is studied in conjunction with the acyclic hamiltonian completion
problem and the first time that an optimal algorithm with respect to spine
crossing minimization is presented for upward topological book embeddings
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
In this paper we study the problem of existence of a crossing-free acyclic
hamiltonian path completion (for short, HP-completion) set for embedded upward
planar digraphs. In the context of book embeddings, this question becomes:
given an embedded upward planar digraph , determine whether there exists an
upward 2-page book embedding of preserving the given planar embedding.
Given an embedded -digraph which has a crossing-free HP-completion
set, we show that there always exists a crossing-free HP-completion set with at
most two edges per face of . For an embedded -free upward planar digraph
, we show that there always exists a crossing-free acyclic HP-completion set
for which, moreover, can be computed in linear time. For a width-
embedded planar -digraph , we show that we can be efficiently test
whether admits a crossing-free acyclic HP-completion set.Comment: Accepted to ISAAC200
Offline and online variants of the Traveling Salesman Problem
In this thesis, we study several well-motivated variants of the Traveling Salesman Problem (TSP). First, we consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a Polynomial Time Approximation Scheme (PTAS) for the single vehicle scheduling problem on trees which have a constant number of leaves. This PTAS can be easily adapted to accommodate various starting/ending constraints. We then extended this to a PTAS for the multiple vehicle problem where vehicles operate in disjoint subtrees. We also present competitive online algorithms for some single vehicle scheduling problems. Secondly, we study a class of problems called the Online Packet TSP Class (OP-TSP-CLASS). It is based on the online TSP with a packet of requests known and available for scheduling at any given time. We provide a 5/3 lower bound on any online algorithm for problems in OP-TSP-CLASS. We extend this result to the related k-reordering problem for which a 3/2 lower bound was known. We develop a κ+1-competitive algorithm for problems in OP-TSP-CLASS, where a κ-approximation algorithm is known for the offline version of that problem. We use this result to develop an offline m(κ+1)-approximation algorithm for the Precedence-Constrained TSP (PCTSP) by segmenting the n requests into m packets. Its running time is mf(n/m) given a κ-approximation algorithm for the offline version whose running time is f(n)
Contributions on secretary problems, independent sets of rectangles and related problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 187-198).We study three problems arising from different areas of combinatorial optimization. We first study the matroid secretary problem, which is a generalization proposed by Babaioff, Immorlica and Kleinberg of the classical secretary problem. In this problem, the elements of a given matroid are revealed one by one. When an element is revealed, we learn information about its weight and decide to accept it or not, while keeping the accepted set independent in the matroid. The goal is to maximize the expected weight of our solution. We study different variants for this problem depending on how the elements are presented and on how the weights are assigned to the elements. Our main result is the first constant competitive algorithm for the random-assignment random-order model. In this model, a list of hidden nonnegative weights is randomly assigned to the elements of the matroid, which are later presented to us in uniform random order, independent of the assignment. The second problem studied is the jump number problem. Consider a linear extension L of a poset P. A jump is a pair of consecutive elements in L that are not comparable in P. Finding a linear extension minimizing the number of jumps is NP-hard even for chordal bipartite posets. For the class of posets having two directional orthogonal ray comparability graphs, we show that this problem is equivalent to finding a maximum independent set of a well-behaved family of rectangles. Using this, we devise combinatorial and LP-based algorithms for the jump number problem, extending the class of bipartite posets for which this problem is polynomially solvable and improving on the running time of existing algorithms for certain subclasses. The last problem studied is the one of finding nonempty minimizers of a symmetric submodular function over any family of sets closed under inclusion. We give an efficient O(ns)-time algorithm for this task, based on Queyranne's pendant pair technique for minimizing unconstrained symmetric submodular functions. We extend this algorithm to report all inclusion-wise nonempty minimal minimizers under hereditary constraints of slightly more general functions.by José Antonio Soto.Ph.D