631 search results - page 1 / 127 » Additive Approximation for Edge-Deletion Problems |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
AAAI
2006
13 years 6 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...