Results 1  10
of
32,101
edgedeletion NPcomplete problems
 Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), ACM
, 1978
"... If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties that ..."
Abstract

Cited by 90 (0 self)
 Add to MetaCart
any "reasonable " approximation is also NPcomplete. Edgedeletion problems seem to be less amenable to such generalizations. We show however that for several common properties (e.g. planar, outerplanar, linegraph, transitive digraph) the edgedeletion problem is NPcomplete.
Additive approximation for edgedeletion problems
 Proc. of FOCS 2005
, 2005
"... A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following algorithmic problem, called the edgedeletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that are needed in order to turn G ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following algorithmic problem, called the edgedeletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that are needed in order to turn
Some NPcomplete Geometric Problems
"... We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NPhard i ..."
Abstract

Cited by 99 (1 self)
 Add to MetaCart
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP
Problem Kernels for NPComplete Edge Deletion Problems: Split and Related Graphs
"... Abstract. In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NPcomplete edge deletion problems where the goal graph has to be a chain, a split, a threshold, or a cotrivially p ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NPcomplete edge deletion problems where the goal graph has to be a chain, a split, a threshold, or a co
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
Broadcasting and NPcompleteness
"... In this note, we answer two questions arising in broadcasting problems in networks. We first describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NPcompleteness of finding disjoint spanning trees of minimum depth, rooted at a given vertex. 1 Introduction I ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note, we answer two questions arising in broadcasting problems in networks. We first describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NPcompleteness of finding disjoint spanning trees of minimum depth, rooted at a given vertex. 1 Introduction
.4 Coping With NpCompleteness
"... s reductions often produce instances of the problem that are unnaturally complex. Perhaps what we really need to solve is a more tractable special case of the problem. For example, we have already seen that there is an important special case of SATISFIABILITY that can be easily solved efficiently: ..."
Abstract
 Add to MetaCart
: 2SATISFIABILITY (recall Section 6.3). If all instances of SATISFIABILITY that we must solve have clauses of this kind, then the fact that the general problem is NPcomplete is rather irrelevant. But often a special case of interest turns out to be itself NPcomplete for example, 3SATISFIABILITY
Some NPcomplete Geometric Problems
 In 8th ACM Symposium on Theory of Computing, STOC
, 1976
"... We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NPhard if ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP
Results 1  10
of
32,101