The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 68W25 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2001-2008 (19) 2009 (2)
Publication types (Num. hits)
article(21)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 49 occurrences of 20 keywords

Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
22Beong In Yun, Miodrag S. Petkovic Iterative methods based on the signum function approach for solving nonlinear equations. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 65H05, 68W25
22János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót Improved lower bounds for semi-online bin packing problems. Search on Bibsonomy Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68Q25, 68W40, 68W25
22Johan Håstad Every 2-csp Allows Nontrivial Approximation. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subject classification. 68W25, 68Q25
22Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez Variable neighbourhood search: methods and applications. Search on Bibsonomy 4OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF MSC classification 90C59, 68W25, 68T20
22Linas Vepstas An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions. Search on Bibsonomy Numer. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 65B10 (primary), 11M35, 11Y35, 33F05, 68W25
22Klaus Jansen, Hu Zhang 0004 Approximation algorithms for general packing problems and their application to the multicast congestion problem. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68W25, 90C25, 90C05, 68W40, 68M10
22Béla Csaba, András Pluhár A randomized algorithm for the on-line weighted bipartite matching problem. Search on Bibsonomy J. Sched. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68R10, 68W40, 68W25
22Lap Chi Lau An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
22Jirí Sgall, Gerhard J. Woeginger An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68W25, 90C27
22Bruno Escoffier Polynomial approximation: a structural and operational study. Search on Bibsonomy 4OR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF MSC classification 68Q17, 68Q25, 05C15, 68W25
22Harold N. Gabow On the Linfinity-norm of extreme points for crossing supermodular directed network LPs. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68W25, 68R10, 90C05, 05C40, 90B10, 05C20
22Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta Approximate min-max relations for odd cycles in planar graphs. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C38, 90C27, 05C85, 68W25
22Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta Network Design Via Iterative Rounding Of Setpair Relaxations. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10
22Corinne Feremans, Alexander Grigoriev, René Sitters The geometric generalized minimum spanning tree problem with grid clustering. Search on Bibsonomy 4OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF MSC classification 68Q17, 68W25
22Leonard J. Schulman, Vijay V. Vazirani A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68Q15, 68W20, 62F25, 68Q25, 68W25
22Joseph Cheriyan, Howard J. Karloff, Yuval Rabani Approximating Directed Multicuts. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25
22Hanno Lefmann On Heilbronn's Problem in Higher Dimension. Search on Bibsonomy Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68W25, 05C69, 68R05
22Martin Grohe Local Tree-Width, Excluded Minors, and Approximation Algorithms. Search on Bibsonomy Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C83, 05C85, 68W25
22Vangelis Th. Paschos Polynomial Approximation and Graph-Coloring. Search on Bibsonomy Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25
22Uriel Feige, Christian Scheideler Improved Bounds for Acyclic Job Shop Scheduling. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68M20, 90B35, 68W25
22Kamal Jain A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68W25, 90C57
Displaying result #1 - #21 of 21 (100 per page; Change: )
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