English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2357985      Online Users : 49
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51717

Title: Tight Approximation for Partial Vertex Cover with Hard Capacities
Authors: Jia-Yau Shiau
Mong-Jen Kao
Ching-Chi Lin
D.T. Lee
Contributors: 國立臺灣海洋大學:資訊工程學系
Keywords: Approximation Algorithm
Capacitated Vertex Cover
Hard Capacities
Date: 2018-11
Issue Date: 2018-12-21T02:45:09Z
Publisher: Theoretical Computer Science
Abstract: Abstract: We consider the partial vertex cover problem with hard capacity constraints (Partial VC-HC)
on hypergraphs. In this problem we are given a hypergraph G = (V, E) with a maximum edge
size f and a covering requirement R. Each edge is associated with a demand, and each vertex is
associated with a capacity and an (integral) available multiplicity. The objective is to compute
a minimum vertex multiset such that at least R units of demand from the edges are covered by
the capacities of the vertices in the multiset and the multiplicity of each vertex does not exceed
its available multiplicity.
In this paper we present an f-approximation for this problem, improving over a previous
result of (2f + 2)(1 + ) by Cheung et al to the tight extent possible. Our new ingredient of this
work is a generalized analysis on the extreme points of the natural LP, developed from previous
works, and a strengthened LP lower-bound obtained for the optimal solutions.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51717
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback