MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Capacitated vertex covering." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

14 documents found, showing 1 through 10. Next 10 →

ATOM

Capacitated vertex covering
by Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or — 2003 — JOURNAL OF ALGORITHMS
…Journal of Algorithms 48 (2003) 257–270 Capacitated vertex covering ✩ www…
Cited by 12 (2 self) – Add To MetaCart

Capacitated domination and covering: A parameterized perspective
by Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger — Proceedings 3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008
… † Saket Saurabh † Yngve Villanger † Abstract Capacitated versions of Dominating Set and Vertex Cover have…
Cited by 4 (4 self) – Add To MetaCart

Dependent Rounding in Bipartite Graphs Rajiv Gandhi
by unknown authors
…-maximization in broadcast scheduling, (ii) delayminimization in broadcast scheduling, and (iii) capaci-tated vertex cover…
Add To MetaCart

Dependent rounding and its applications to approximation algorithms
by Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan — 2006 — Journal of the ACM
…. Finally, we present an additional application, the capacitated vertex cover problem, in Appendix A. A…
Cited by 9 (0 self) – Add To MetaCart

Dependent Rounding in Bipartite Graphs
by Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
… scheduling, (ii) delayminimization in broadcast scheduling, and (iii) capacitated vertex cover; ¯ fair…
Cited by 18 (3 self) – Add To MetaCart

geb. am 18.11.1978 in München
by Friedrich-schiller-universität Jena, Prof Dr, Rolf Niedermeier, Dipl. -inf Jiong Guo, Dipl. -inf Sebastian Wernicke, Jena Zusammenfassung
… Cover und Capacitated Vertex Cover, welche sowohl in der Theorie als auch in Anwendungen bedeutend sind…
Add To MetaCart

Incompressibility through Colors and IDs
by Michael Dom, Daniel Lokshtanov, Saket Saurabh
… of terminals and solution size, and the Connected Vertex Cover and Capacitated Vertex Cover problems do…
Add To MetaCart

A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
by Julián Mestre — 2005 — In 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, volume 3624 of LNCS
…-approximation for a more general version of the problem. In the partial capacitated vertex cover problem each…
Cited by 2 (2 self) – Add To MetaCart

Primal-dual based distributed algorithms for Vertex Cover with semi-hard capacities
by F. Grandoni, J. Könemann — 2005 — In Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’05
…@(email omitted); In this paper we consider the weighted, capacitated vertex cover problem with hard capacities…
Cited by 4 (0 self) – Add To MetaCart

Parameterized complexity of generalized vertex cover problems
by Jiong Guo, Rolf Niedermeier, Sebastian Wernicke — 2005 — In Proc. 9th WADS, volume 3608 of LNCS
…,niedermr,wernicke}@(email omitted); Abstract. Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex…
Cited by 11 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB