22 search results - page 1 / 5 » wea 2007 |
WEA
2007
Springer
13 years 10 months ago
2007
Springer
WEA
2007
Springer
13 years 10 months ago
2007
Springer
WEA
2007
Springer
13 years 10 months ago
2007
Springer
WEA
2007
Springer
13 years 10 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...
WEA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...