Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
2Activity

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
Advanced Complexity Theory

Advanced Complexity Theory

Ratings: (0)|Views: 273 |Likes:
Published by nricci02
Libro de Complejidad Computacional
Libro de Complejidad Computacional

More info:

Categories:Types, Research, Science
Published by: nricci02 on Apr 14, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

02/06/2013

pdf

text

original

 
AdvancedComplexityTheory
Markus Bl¨aser & Bodo MantheyUniversit¨at des SaarlandesDraft—February 27, 2010 and forever
 
2
 
1 Complexity of optimization prob-lems
1.1 Optimization problems
The study of the complexity of solving optimization problems is an impor-tant practical aspect of complexity theory. A good textbook on this topic isthe one by Ausiello et al. [ACG
+
99]. The book by Vazirani [Vaz01] is alsorecommend, but its focus is on the algorithms side.
Definition 1.1.
An 
optimization problem
is a 4-tuple
(I
,
S
,
m
,
goal
)
where1.
I
{
0
,
1
}
is the set of 
valid instances
of 
,2.
S
is a function that assigns to each valid instance
x
the set of 
feasiblesolutions S
(
x
)
of 
x
, which is a subset of 
{
0
,
1
}
.
1
3.
m
:
{
(
x,y
)
|
x
I
and 
y
S
(
x
)
} →
N
+
is the
objective function
or 
measure function
.
m
(
x,y
)
is the objective value of the feasiblesolution 
y
(with respect to
x
).4.
goal
{
min
,
max
}
specifies the type of the optimization problem.Either it is a minimization or a maximization problem.
When the context is clear, we will drop the subscript
. Formally,an optimization problem is defined over the alphabet
{
0
,
1
}
. But as usual,when we talk about concrete problems, we want to talk about graphs, nodes,weights, etc. In this case, we tacitly assume that we can always find suitableencodings of the objects we talk about.Given an instance
x
of the optimization problem
, we denote by S
(
x
)the set of all optimal solutions, that is, the set of all
y
S
(
x
) such thatm
(
x,y
) = goal
{
m
(
x,z
)
|
z
S
(
x
)
}
.
(Note that the set of optimal solutions could be empty, since the maximumneed not exist. The minimum always exists, since we m
only attains val-ues in
N
+
. In the following we will assume that there are always optimal
1
Some authors also assume that for all
x
I
, S
(
x
)
=
. In this case the class
NPO
defined in the next section would be equal to the class
exp
-
APX
(defined somewhere else).
3

Activity (2)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->