1,876 research outputs found
The 0-1 inverse maximum stable set problem
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal. We focus on its 0-1 version, which is to modify as little as possible the structure of the given instance so that the fixed solution becomes optimal in the new instance. In this paper, we consider the 0-1 inverse maximum stable set problem against a specific (optimal or not) algorithm, which is to delete as few vertices as possible so that the fixed stable set S* can be returned as a solution by the given algorithm in the new instance. Firstly, we study the hardness and approximation results of the 0-1 inverse maximum stable set problem against the algorithms. Greedy and 2-opt. Secondly, we identify classes of graphs for which the 0-1 inverse maximum stable set problem can be polynomially solvable. We prove the tractability of the problem for several classes of perfect graphs such as comparability graphs and chordal graphs.Combinatorial inverse optimization, maximum stable set problem, NP-hardness, performance ratio, perfect graphs.
Krausz dimension and its generalizations in special graph classes
A {\it krausz -partition} of a graph is the partition of into
cliques, such that any vertex belongs to at most cliques and any two
cliques have at most vertices in common. The {\it -krausz} dimension
of the graph is the minimum number such that has a
krausz -partition. 1-krausz dimension is known and studied krausz
dimension of graph .
In this paper we prove, that the problem is polynomially
solvable for chordal graphs, thus partially solving the problem of P. Hlineny
and J. Kratochvil. We show, that the problem of finding -krausz dimension is
NP-hard for every , even if restricted to (1,2)-colorable graphs, but
the problem is polynomially solvable for -polar
graphs for every fixed
Stable marriage and roommates problems with restricted edges: complexity and approximability
In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. We investigate the complexity of finding a solution satisfying additional constraints on restricted pairs of agents. Restricted pairs can be either forced or forbidden. A stable solution must contain all of the forced pairs, while it must contain none of the forbidden pairs.
Dias et al. (2003) gave a polynomial-time algorithm to decide whether such a solution exists in the presence of restricted edges. If the answer is no, one might look for a solution close to optimal. Since optimality in this context means that the matching is stable and satisfies all constraints on restricted pairs, there are two ways of relaxing the constraints by permitting a solution to: (1) be blocked by as few as possible pairs, or (2) violate as few as possible constraints n restricted pairs.
Our main theorems prove that for the (bipartite) Stable Marriage problem, case (1) leads to View the MathML source-hardness and inapproximability results, whilst case (2) can be solved in polynomial time. For non-bipartite Stable Roommates instances, case (2) yields an View the MathML source-hard but (under some cardinality assumptions) 2-approximable problem. In the case of View the MathML source-hard problems, we also discuss polynomially solvable special cases, arising from restrictions on the lengths of the preference lists, or upper bounds on the numbers of restricted pairs
A hybrid constraint programming and semidefinite programming approach for the stable set problem
This work presents a hybrid approach to solve the maximum stable set problem,
using constraint and semidefinite programming. The approach consists of two
steps: subproblem generation and subproblem solution. First we rank the
variable domain values, based on the solution of a semidefinite relaxation.
Using this ranking, we generate the most promising subproblems first, by
exploring a search tree using a limited discrepancy strategy. Then the
subproblems are being solved using a constraint programming solver. To
strengthen the semidefinite relaxation, we propose to infer additional
constraints from the discrepancy structure. Computational results show that the
semidefinite relaxation is very informative, since solutions of good quality
are found in the first subproblems, or optimality is proven immediately.Comment: 14 page
On a class of intersection graphs
Given a directed graph D = (V,A) we define its intersection graph I(D) =
(A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent
if their corresponding arcs share a common node that is the tail of at least
one of these arcs. We call these graphs facility location graphs since they
arise from the classical uncapacitated facility location problem. In this paper
we show that facility location graphs are hard to recognize and they are easy
to recognize when the graph is triangle-free. We also determine the complexity
of the vertex coloring, the stable set and the facility location problems on
that class
An Overview of Polynomially Computable Characteristics of Special Interval Matrices
It is well known that many problems in interval computation are intractable,
which restricts our attempts to solve large problems in reasonable time. This
does not mean, however, that all problems are computationally hard. Identifying
polynomially solvable classes thus belongs to important current trends. The
purpose of this paper is to review some of such classes. In particular, we
focus on several special interval matrices and investigate their convenient
properties. We consider tridiagonal matrices, {M,H,P,B}-matrices, inverse
M-matrices, inverse nonnegative matrices, nonnegative matrices, totally
positive matrices and some others. We focus in particular on computing the
range of the determinant, eigenvalues, singular values, and selected norms.
Whenever possible, we state also formulae for determining the inverse matrix
and the hull of the solution set of an interval system of linear equations. We
survey not only the known facts, but we present some new views as well
On the Complexity of Spill Everywhere under SSA Form
Compilation for embedded processors can be either aggressive (time consuming
cross-compilation) or just in time (embedded and usually dynamic). The
heuristics used in dynamic compilation are highly constrained by limited
resources, time and memory in particular. Recent results on the SSA form open
promising directions for the design of new register allocation heuristics for
embedded systems and especially for embedded compilation. In particular,
heuristics based on tree scan with two separated phases -- one for spilling,
then one for coloring/coalescing -- seem good candidates for designing
memory-friendly, fast, and competitive register allocators. Still, also because
of the side effect on power consumption, the minimization of loads and stores
overhead (spilling problem) is an important issue. This paper provides an
exhaustive study of the complexity of the ``spill everywhere'' problem in the
context of the SSA form. Unfortunately, conversely to our initial hopes, many
of the questions we raised lead to NP-completeness results. We identify some
polynomial cases but that are impractical in JIT context. Nevertheless, they
can give hints to simplify formulations for the design of aggressive
allocators.Comment: 10 page
A note on anti-coordination and social interactions
This note confirms a conjecture of [Bramoull\'{e}, Anti-coordination and
social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The
problem, which we name the maximum independent cut problem, is a restricted
version of the MAX-CUT problem, requiring one side of the cut to be an
independent set. We show that the maximum independent cut problem does not
admit any polynomial time algorithm with approximation ratio better than
, where is the number of nodes, and arbitrarily
small, unless P=NP. For the rather special case where each node has a degree of
at most four, the problem is still MAXSNP-hard.Comment: 7 page
- …