Results 1  10
of
400,424
On the Complexity of VertexDisjoint LengthRestricted Path Problems
, 1998
"... Let G = (V; E) be a simple graph and s and t be two distinct vertices of G. A path in G is called `bounded for some ` 2 N , if it does not contain more than ` edges. We study the computational complexity of approximating the optimum value for two optimization problems of finding sets of vertexd ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Let G = (V; E) be a simple graph and s and t be two distinct vertices of G. A path in G is called `bounded for some ` 2 N , if it does not contain more than ` edges. We study the computational complexity of approximating the optimum value for two optimization problems of finding sets of vertexdisjoint
VertexDisjoint Cycles Containing Prescribed Vertices
, 2003
"... Enomoto [7] conjectured that if the minimum degree of a graph G of order n 4k 1 is at least the integer ..."
Abstract
 Add to MetaCart
Enomoto [7] conjectured that if the minimum degree of a graph G of order n 4k 1 is at least the integer
An Efficient Algorithm for the VertexDisjoint Paths Problem in Random Graphs
, 1996
"... Given a graph G = (V, E) and a set of pairs of vertices in V, we are interested in finding for each pair (ui, b;) a path connecting ai to bi, such that the set of paths so found is vertexdisjoint, (The problem is M/Pcomplete for general graphs as well as for planar graphs. It is in P if the number ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Given a graph G = (V, E) and a set of pairs of vertices in V, we are interested in finding for each pair (ui, b;) a path connecting ai to bi, such that the set of paths so found is vertexdisjoint, (The problem is M/Pcomplete for general graphs as well as for planar graphs. It is in P
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Shortest VertexDisjoint TwoFace Paths in Planar Graphs
, 2008
"... Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1,..., sk be vertices incident with s; let t1,..., tk be vertices incident with t. We give an algorithm to compute k pairwise vertexdisjoint paths connecting the pai ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1,..., sk be vertices incident with s; let t1,..., tk be vertices incident with t. We give an algorithm to compute k pairwise vertexdisjoint paths connecting
Unified analysis of discontinuous Galerkin methods for elliptic problems
 SIAM J. Numer. Anal
, 2001
"... Abstract. We provide a framework for the analysis of a large class of discontinuous methods for secondorder elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical treatment ..."
Abstract

Cited by 519 (31 self)
 Add to MetaCart
Abstract. We provide a framework for the analysis of a large class of discontinuous methods for secondorder elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Results 1  10
of
400,424