3875 search results - page 171 / 775 » Approximation algorithms for the 0-extension problem |
135
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
130
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
167
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
115
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
138
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...