871 search results - page 80 / 175 » The vertex-cover polynomial of a graph |
112
click to vote
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
JMLR
2006
14 years 9 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...