The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase k-cover (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1954-1972 (16) 1973-1976 (18) 1977-1978 (15) 1979-1981 (25) 1982-1983 (21) 1984-1985 (31) 1986 (18) 1987 (25) 1988 (24) 1989 (38) 1990 (51) 1991 (38) 1992 (51) 1993 (70) 1994 (70) 1995 (58) 1996 (115) 1997 (92) 1998 (108) 1999 (129) 2000 (162) 2001 (218) 2002 (288) 2003 (356) 2004 (475) 2005 (585) 2006 (675) 2007 (739) 2008 (806) 2009 (582) 2010 (303) 2011 (262) 2012 (314) 2013 (278) 2014 (316) 2015 (370) 2016 (390) 2017 (381) 2018 (511) 2019 (620) 2020 (664) 2021 (601) 2022 (647) 2023 (672) 2024 (156)
Publication types (Num. hits)
article(6031) book(4) data(5) incollection(60) inproceedings(6240) phdthesis(43) www(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5200 occurrences of 3027 keywords

Results
Found 12402 publication records. Showing 12384 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
82Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding
78Özgür Sümer Partial covering of hypergraphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF partial hypergraph cover, partial set cover, greedy algorithm
70Rajiv Gandhi, Samir Khuller, Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
61Nayantara Mallesh, Matthew K. Wright Countering Statistical Disclosure with Receiver-Bound Cover Traffic. Search on Bibsonomy ESORICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cover traffic, anonymity, privacy-enhancing technologies
61Jianqing Xi, Fuqiang Chen, Pingjian Zhang A New Bitmap Index and a New Data Cube Compression Technology. Search on Bibsonomy ICCSA (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF qcbit index, seqkey cover quotient cube, quotient cube, cover quotient cube, data cube, bitmap index
61Katerina Asdre, Stavros D. Nikolopoulos The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. Search on Bibsonomy FAW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fixed-endpoint path cover, complement reducible graphs, linear-time algorithms, perfect graphs, cographs, path cover
61Kezhong Lu, XiaoHui Lin 0001, Fengxia Ding A Local Voronoi Diagram-Based Approximate Algorithm for Minimum Disc Cover Problem. Search on Bibsonomy PDCAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF minimum disc cover problem, disc cover set, average coverage degree, wireless sensor network, node scheduling
56Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
56Jean Cardinal, Eythan Levy Connected Vertex Covers in Dense Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF connected vertex cover, dense graph, approximation algorithm, vertex cover
56Matti Åstrand, Jukka Suomela Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network
52Eran Halperin, Aravind Srinivasan Improved Approximation Algorithms for the Partial Vertex Cover Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
52Reuven Bar-Yehuda One for the Price of Two: A Unified Approach for Approximating Covering Problems. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
52Adam Cannon, Lenore Cowen Approximation Algorithms for the Class Cover Problem. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF disk cover, margin classifier, classification, approximation algorithms, set cover
48Yoshiaki Nonaka, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita How to Design a Linear Cover Time Random Walk on a Finite Graph. Search on Bibsonomy SAGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
48Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Parameterized Complexity of Vertex Cover Variants. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
48Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Parameterized Complexity of Generalized Vertex Cover Problems. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
48Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai An Optimal Algorithm for the Minimum Disc Cover Problem. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimum disc cover, ?-hull, Applications in ad hoc networks, Optimal algorithms
48Shuai Zhang, Jingyin Zhao, Linyi Li Grass Cover Change Model Based on Cellular Automata. Search on Bibsonomy CCTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF grass cover change, cellular automata
48Maytham Safar, Sami Habib Hard Constrained Vertex-Cover Communication Algorithm for WSN. Search on Bibsonomy EUC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF discrete space, Wireless sensor network, optimization, communication, vertex cover, evolutionary approach
47Daniel Mölle, Stefan Richter 0001, Peter Rossmanith Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity
47Petr Slavík A Tight Analysis of the Greedy Algorithm for Set Cover. Search on Bibsonomy STOC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fractional set cover, partial set cover, approximation algorithms, greedy algorithm, set cover
47Bonnie Berger, John Rompel, Peter W. Shor Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF unweighted set cover problems, efficient NC algorithms, NC approximation algorithms, weighted set cover problems, set cover algorithm, finite union, finite intersection, finite VC dimension, NC hypothesis finder, linear-processor NC algorithm, computational geometry, learning theory, closure, concept class
44Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Thomas Sauerwald Expansion and the cover time of parallel random walks. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF random walks, expander, expansion, cover time
43Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Vertex cover, Primal-dual algorithms
43Yi Yu 0001, J. Stephen Downie, Fabian Mörchen, Lei Chen 0002, Kazuki Joe, Vincent Oria COSIN: content-based retrieval system for cover songs. Search on Bibsonomy ACM Multimedia The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cover songs, musical audio sequences summarization, content-based audio retrieval, hash-based indexing
43Jihui Wang, Sumei Zhang, Jianfeng Hou On f -Edge Cover-Coloring of Simple Graphs. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Simple graph, f-edge cover-coloring, Edge-coloring
43Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF minimum weight vertex cover, meta-heuristic algorithm, ant colony optimization
43Yin Li, William F. Smyth Computing the Cover Array in Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Quasiperiod, Algorithm, Period, String, Cover, Word
43Fanica Gavril, Alon Itai Covering a Tree by a Forest. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF vertex-cover of a tree by a forest, edge-cover of a tree by a forest, graph algorithms
43Reuven Bar-Yehuda One for the Price of Two: a Unified Approach for Approximating Covering Problems. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set
43Torsten Fahle, Karsten Tiemann A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem
39Maytham Safar, Mohammad Taha, Sami Habib Modeling the Communication Problem in Wireless Sensor Networks as a Vertex Cover. Search on Bibsonomy AICCSA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Valeri Korjik, Guillermo Morales-Luna Information Hiding through Noisy Channels. Search on Bibsonomy Information Hiding The full citation details ... 2001 DBLP  DOI  BibTeX  RDF cover message, wire-trap channel concept, information-theoretically secure model, randomized encoding, linear binary codes, Information hiding
39Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled On the set multi-cover problem in geometric settings. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF set cover, cuttings, LP rounding
39Jean Cardinal, Samuel Fiorini, Gwenaël Joret Tight Results on Minimum Entropy Set Cover. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Entropy, Greedy algorithm, Hardness of approximation, Set cover
39Shyam Boriah, Vipin Kumar 0001, Michael S. Steinbach, Christopher Potter, Steven A. Klooster Land cover change detection: a case study. Search on Bibsonomy KDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF time series, change detection, land use, land cover
39Qizhi Fang, Liang Kong Core Stability of Vertex Cover Games. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Vertex cover game, stable core, largeness, exactness, balanced, extendability
39Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg Frugality ratios and improved truthful mechanisms for vertex cover. Search on Bibsonomy EC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF frugality, auctions, vertex cover
39Tianping Shuai, Xiao-Dong Hu 0001 Connected Set Cover Problem and Its Applications. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithm, Set cover, Wavelength assignment, Performance ratio
39Noga Alon, Yossi Azar, Shai Gutner Admission control to minimize rejections and online set cover with repetitions. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF admission control, competitive, set cover, on-line
39Toshihiro Fujito On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF covering integer program, approximation algorithm, combinatorial optimization, partial cover
39Giles M. Foody Mapping Land Cover from Remotely Sensed Data with a Softened Feedforward Neural Network Classification. Search on Bibsonomy J. Intell. Robotic Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF soft classification, neural network, remote sensing, land cover
39Uriel Feige A Threshold of ln n for Approximating Set Cover. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF set cover, approximation ratio
39C.-J. Richard Shi, Janusz A. Brzozowski Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF cluster-cover, logic minimizaiton, self-checking logic design, topological routing, NP-completeness, state assignment
39Anthony Chung, Deepinder P. Sidhu On Conditions for Defining a Closed Cover to Verify Progress for Communicating Finite State Machines. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF progress verification, closed cover, FIFO channels, structural partition technique, protocols, finite automata, lossless, communicating finite state machines
39Gennian Ge, Alan C. H. Ling Constructions of Quad-Rooted Double Covers. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Orthogonal double cover, Quad-rooted double cover, Group divisible design
39Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Minmax Tree Cover in the Euclidean Space. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms
35Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu Fast computing reachability labelings for large graphs with high compression rate. Search on Bibsonomy EDBT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Gruia Calinescu Bounding the Payment of Approximate Truthful Mechanisms. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Julia Chuzhoy, Joseph Naor Covering Problems with Hard Capacities. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Markus Bläser, Bodo Manthey Two Approximation Algorithms for 3-Cycle Covers. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Zongheng Zhou, Samir R. Das, Himanshu Gupta 0001 Variable radii connected sensor cover in sensor networks. Search on Bibsonomy ACM Trans. Sens. Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF sensor networks, connectivity, coverage, Topology control, energy conservation
35Sumit Gulwani, Madan Musuvathi Cover Algorithms and Their Combination. Search on Bibsonomy ESOP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Sushil K. Prasad, Akshaye Dhawan Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets. Search on Bibsonomy HiPC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Yanli Cai, Wei Lou, Minglu Li 0001 Cover Set Problem in Directional Sensor Networks. Search on Bibsonomy FGCN (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks. Search on Bibsonomy ICCNMC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Kamesh Munagala, Shivnath Babu, Rajeev Motwani 0001, Jennifer Widom The Pipelined Set Cover Problem. Search on Bibsonomy ICDT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Elena Prieto-Rodriguez, Christian Sloper Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Toshihiro Fujito, Tsuyoshi Okumura A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Danny Z. Chen, Xiaobo Hu 0001, Xiaodong Wu 0001 Optimal Polygon Cover Problems and Applcations. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Kasturi R. Varadarajan Weighted geometric set cover via quasi-uniform sampling. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation, set cover, epsilon nets
34Eyjolfur Ingi Asgeirsson, Cliff Stein 0001 Bounded-space online bin cover. Search on Bibsonomy J. Sched. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bin cover, Bounded-space, Markov chains, Online
34Hedieh Sajedi, Mansour Jamzad Secure Cover Selection Steganography. Search on Bibsonomy ISA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Cover Selection, Steganography Capacity, Steganography
34ZongBo Shang, Jeffrey D. Hamerlinck Using Statistics and Spatial Data Mining to Study Land Cover in Wyoming : Can We Predict Vegetation Types from Environmental Variables? Search on Bibsonomy ICDM Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Wyoming, discriminant analysis, Factor analysis, land cover, classification and regression tree
34Jean-Marc Champarnaud, Franck Guingne, Jacques Farré Reducing Acyclic Cover Transducers. Search on Bibsonomy CIAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF subsequential transducer, cover transducer for a finite subsequential function, finite state transducer, state reduction
34Bruno Escoffier, Laurent Gourvès, Jérôme Monnot Complexity and Approximation Results for the Connected Vertex Cover Problem. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
34Himanshu Gupta 0001, Zongheng Zhou, Samir R. Das, Quinyi Gu Connected sensor cover: self-organization of sensor networks for efficient query execution. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF connected sensor cover, sensor connectivity, sensor networks, query optimization, sensor coverage
34Fabrizio Grandoni 0001, Jochen Könemann, Alessandro Panconesi, Mauro Sozio Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithms, distributed algorithms, vertex cover, primal-dual algorithms
34Lixu Gu Character Region Identification from Cover Images Using DTT. Search on Bibsonomy ICADL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Optical Character Reader, Cover Image, Region Identification, DTT
34Jonathan David Farley Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. Search on Bibsonomy Graphs Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Differential poset, Fibonacci lattice, (partially) Ordered set, Cover function, Distributive lattice
34Charles R. Tolle, Timothy R. McJunkin, David J. Gorisch Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF suboptimal cover, box counting, clustering, texture analysis, Fuzzy-C means, Fractal dimension
34Jenchyou Lii, Sargur N. Srihari Location of name and address on fax cover pages. Search on Bibsonomy ICDAR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF fax cover pages, mail routing system, block segmentation, data field indicators, machined-printed images, handwritten images, image recognition, page segmentation, geometric features, text recognition, document analysis system, image extraction
34Yossi Azar, Iftah Gamzu, Xiaoxin Yin Multiple intents re-ranking. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF min-sum set cover, minimum latency set cover, multiple intents, approximation algorithms, ranking
34Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito An improved constant-time approximation algorithm for maximum matchings. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
34Venkatesh Raman 0001, Saket Saurabh 0001 Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity
34Matt Gibson 0001, Kasturi R. Varadarajan Decomposing Coverings and the Planar Sensor Cover Problem. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Decomposing Multiple Coverings, Sensor Cover, Restricted Strip Cover, Approximation Algorithms
34Reuven Bar-Yehuda Using Homogenous Weights for Approximating the Partial Cover Problem. Search on Bibsonomy SODA The full citation details ... 1999 DBLP  BibTeX  RDF approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering
34Sridhar Rajagopalan, Vijay V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
31Klim Efremenko, Omer Reingold How Well Do Random Walks Parallelize?. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Markov Chains, Random Walks
31Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni Limitations of cross-monotonic cost sharing schemes. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
31Ajoy Kumar Datta, Rajesh Patel, Maria Gradinariu Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks. Search on Bibsonomy ISPAN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Antonia Bertolino, Martina Marré Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers
30Chen Avin, Michal Koucký 0001, Zvi Lotker How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Yi Yu 0001, J. Stephen Downie, Fabian Mörchen, Lei Chen 0002, Kazuki Joe Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs. Search on Bibsonomy ISM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Hao-xiang Wu, Qi-ting Huang, Lian-qing Zhou, Iwao Okutani Identification of Band Reflectance for Each Category and Land-Cover Classification Using Fuzzy Least-Squares Method. Search on Bibsonomy FSKD (3) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Jiang Li Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2007 DBLP  DOI  BibTeX  RDF clustering, information retrieval, object-oriented databases, remote sensing, change detection
30HongLiang Yuan, Changguo Guo, Peng Zou The Subscription-Cover Based Routing Algorithm in Content-Based Publish/Subscribe. Search on Bibsonomy GPC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Alain Casali, Rosine Cicchetti, Lotfi Lakhal Essential Patterns: A Perfect Cover of Frequent Patterns. Search on Bibsonomy DaWaK The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière Greedy Differential Approximations for Min Set Cover. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Faisal N. Abu-Khzam, Michael A. Langston A Direct Algorithm for the Parameterized Face Cover Problem. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Robert Gilmore Pontius Jr., Aditya Agrawal, Diana Huffaker Estimating the uncertainty of land-cover extrapolations while constructing a raster map from tabular data. Search on Bibsonomy J. Geogr. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Rolf Niedermeier, Peter Rossmanith On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Cezar Câmpeanu, Nicolae Santean, Sheng Yu 0001 Minimal Cover-Automata for Finite Languages. Search on Bibsonomy Workshop on Implementing Automata The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
30Ravi S. Sandhu, Sushil Jajodia Polyinstantation for Cover Stories. Search on Bibsonomy ESORICS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
30Ruoming Jin, Yang Xiang, Lin Liu 0001 Cartesian contour: a concise representation for a collection of frequent sets. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF concise pattern representation, frequent itemsets, set cover, cartesian product
30Costas Busch, Ryan LaFortune, Srikanta Tirthapura Improved sparse covers for graphs excluding a fixed minor. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF minor free graph, path separator, sparse cover, planar graph, compact routing
30Alexandre H. L. Porto, Valmir Carneiro Barbosa A Methodology for Determining Amino-Acid Substitution Matrices from Set Covers. Search on Bibsonomy EvoWorkshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Substitution matrix, Residue set cover, Sequence alignment
30James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon A Parallel FPT Application For Clusters. Search on Bibsonomy CCGRID The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Fixed-Parameter Tractatbility, k-Vertex Cover, Computational Biochemistry
Displaying result #1 - #100 of 12384 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license