160 search results - page 11 / 32 » Approximating Maximum Edge 2-Coloring in Simple Graphs |
156
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
144
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
142
click to vote
ASPDAC
2001
ACM
15 years 6 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
134
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
138
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...