Search results for "fixed-C"

Found 10 publication records. Showing 10 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Jaroslav Nesetril, Patrice Ossona de Mendez	Linear time low tree-width partitions and algorithmic consequences.	STOC	2006	DBLP DOI BibTeX RDF	bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
11	Holger Keding, Markus Willems, Martin Coors, Heinrich Meyr	FRIDGE: A Fixed-Point Design and Simulation Environment.	DATE	1998	DBLP DOI BibTeX RDF	FRIDGE, interpolative approach, fixed-C, assignment-time instantiation, simulation, design, interpolation, quantization, fixed-point
8	Sanjeev Arora	Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems.	J. ACM	1998	DBLP DOI BibTeX RDF	approximation algorithms, matching, traveling salesman problem, network design, Steiner problem
5	Christian Schindelhauer, Klaus Volbert, Martin Ziegler 0001	Spanners, Weak Spanners, and Power Spanners for Wireless Networks.	ISAAC	2004	DBLP DOI BibTeX RDF
5	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.	FOCS	1997	DBLP DOI BibTeX RDF	randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
3	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter	Algorithms for finding clique-transversals of graphs.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs
3	Carlo Filippi, Alessandro Agnetis	An asymptotically exact algorithm for the high-multiplicity bin packing problem.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
3	Nelly Litvak, Uri Yechiali	Routing in Queues with Delayed Information.	Queueing Syst. Theory Appl.	2003	DBLP DOI BibTeX RDF	delayed information, multiple-server queues, routing, decomposition, vacation models
3	Arfst Nickelsen	Deciding Verbose Languages with Linear Advice.	MFCS	1997	DBLP DOI BibTeX RDF
3	Mario Alberto López, Ravi Janardan, Sartaj K. Sahni	Efficient net extraction for restricted orientation designs [VLSI layout].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF