Results 1  10
of
360
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 243 (0 self)
 Add to MetaCart
(Show Context)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freeman & Co., New York, 1979 (hereinafter referred to as "[G&J]"; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, crossreferences will be given to that book and the list of problems (NPcomplete and harder) presented there. Readers who have results they would like mentioned (NPhardness, PSPACEhardness, polynomialtimesolvability, etc.) or open problems they would like publicized, should
Approximation Algorithms for Disjoint Paths Problems
, 1996
"... The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for w ..."
Abstract

Cited by 168 (0 self)
 Add to MetaCart
The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for which very little is known from the point of view of approximation algorithms. It has recently been brought into focus in work on problems such as VLSI layout and routing in highspeed networks; in these settings, the current lack of understanding of the disjoint paths problem is often an obstacle to the design of practical heuristics.
Fixedparameter tractability and completeness II: On completeness for W[1]
, 1995
"... For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as FEEDBACK VERTEX SET, exhibit fixedparameter tractability: for each ..."
Abstract

Cited by 115 (11 self)
 Add to MetaCart
For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as FEEDBACK VERTEX SET, exhibit fixedparameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a constant independent of k. In a previous paper, the W Hierarchy of parameterixed problems was defined, and complete problems were identified for the classes W[t] for t >= 2. Our main result shows that INDEPENDENT SET is complete for W[1].
Adversarial queueing theory
 In Proc. 28th ACM STOC
, 1996
"... We introduce a new approach to the study of dynamic (or continuous) packet routing, where packets are being continuously injected into a network. Our objective is to study what happens to packet routing under continuous injection ..."
Abstract

Cited by 113 (6 self)
 Add to MetaCart
We introduce a new approach to the study of dynamic (or continuous) packet routing, where packets are being continuously injected into a network. Our objective is to study what happens to packet routing under continuous injection
Finding Odd Cycle Transversals
, 2003
"... We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle cover of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k. ..."
Abstract

Cited by 101 (2 self)
 Add to MetaCart
We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle cover of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k.
Deciding FirstOrder Properties of Locally TreeDecomposable Graphs
 In Proc. 26th ICALP
, 1999
"... . We introduce the concept of a class of graphs being locally treedecomposable. There are numerous examples of locally treedecomposable classes, among them the class of planar graphs and all classes of bounded valence or of bounded treewidth. We show that for each locally treedecomposable cl ..."
Abstract

Cited by 100 (14 self)
 Add to MetaCart
(Show Context)
. We introduce the concept of a class of graphs being locally treedecomposable. There are numerous examples of locally treedecomposable classes, among them the class of planar graphs and all classes of bounded valence or of bounded treewidth. We show that for each locally treedecomposable class C of graphs and for each property ' of graphs that is denable in rstorder logic, there is a linear time algorithm deciding whether a given graph G 2 C has property '. 1 Introduction It is an important task in the theory of algorithms to nd feasible instances of otherwise intractable algorithmic problems. A notion that has turned out to be extremely useful in this context is that of treewidth of a graph. 3Colorability, Hamiltonicity, and many other NPcomplete properties of graphs can be decided in linear time when restricted to graphs whose treewidth is bounded by a xed constant (see [Bod97] for a survey). Courcelle [Cou90] proved a metatheorem, which easily implies numer...
Connectivity and Inference Problems for Temporal Networks
 J. Comput. Syst. Sci
, 2000
"... Many network problems are based on fundamental relationships involving time. Consider, for example, the problems of modeling the flow of information through a distributed network, studying the spread of a disease through a population, or analyzing the reachability properties of an airline timetable. ..."
Abstract

Cited by 86 (3 self)
 Add to MetaCart
(Show Context)
Many network problems are based on fundamental relationships involving time. Consider, for example, the problems of modeling the flow of information through a distributed network, studying the spread of a disease through a population, or analyzing the reachability properties of an airline timetable. In such settings, a natural model is that of a graph in which each edge is annotated with a time label specifying the time at which its endpoints “communicated. ” We will call such a graph a temporal network. To model the notion that information in such a network “flows ” only on paths whose labels respect the ordering of time, we call a path timerespecting if the time labels on its edges are nondecreasing. The central motivation for our work is the following question: how do the basic combinatorial and algorithmic properties of graphs change when we impose this additional temporal condition? The notion of a path is intrinsic to many of the most fundamental algorithmic problems on graphs; spanning trees, connectivity, flows, and cuts are some examples. When we focus on timerespecting paths in place of arbitrary paths, many of these problems acquire a character that is different from the
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
, 1995
"... Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using an algorithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum ..."
Abstract

Cited by 81 (5 self)
 Add to MetaCart
Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using an algorithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than O(logn) (minimum front size and treewidth) and O(log^2 n) (pathwidth and minimum elimination tree height) times the optimal values. In addition, we show that unless P = NP there are no absolute approximation algorithms for any of the parameters.