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:...
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...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...
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...
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...