Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
25	Martin Mundhenk, Anna Slobodová	Optimal Non-approximability of MAXCLIQUE.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
25	Clemens Gröpl, Martin Skutella	Parallel Repetition of MIP(2, 1) Systems.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
25	Artur Andrzejak 0001	Introduction to Randomized Algorithms.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
25	Claus Rick, Hein Röhrig	Deriving Non-approximability Results by Reductions.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
25	Stefan Hougardy	Proof Checking and Non-approximability.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
25	Hennie G. ter Morsche	Attenuation Factors and multivariate periodic spline interpolation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Ferruccio Fontanella	Shape Preserving surface interpolation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Wolfgang Dahmen, Charles A. Micchelli	On the Theory and Application of exponential splines.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Kurt Jetter	A Short Survey on cardinal interpolation by Box splines.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Nira Dyn	Interpolation of scattered Data by radial Functions.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	María Cecilia Rivara	Numerical Generation of Nested Series of General triangular Grids.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Gregory M. Nielson	Coordinate Free scattered Data interpolation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Willi Freeden	Metaharmonic splines for solving the exterior Dirichlet Problem for the Helmholtz equation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Florencio I. Utreras	Constrained surface Construction.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Larry L. Schumaker	Triangulation Methods.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Alain Le Méhauté	Unisolvent interpolation in Irn and the Simplicial Polynomial finite element method.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Paul Sablonnière	Composite finite Elements of class C2.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Felipe Zó	On inequalities arising from Best Local Approximations in Rectangles.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Joseph D. Ward	Polynomial reproducing Formulas and the Commutator of a Locally Supported spline.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Charles K. Chui, Ming-Jun Lai	On multivariate Vertex splines and Applications.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	J. Lorente, V. Ramírez	On interpolation Systems and H-Reducible interpolation Problems.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
25	Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002	The Parameterized Approximability of TSP with Deadlines.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
25	Samir Khuller, Robert Pless, Yoram J. Sussmann	Fault Tolerant K-Center Problems.	CIAC	1997	DBLP DOI BibTeX RDF
25	Jan Vondrák	Optimal approximation for the submodular welfare problem in the value oracle model.	STOC	2008	DBLP DOI BibTeX RDF	combinatorial auctions, matroids, submodular functions
25	Nikhil Bansal 0001, Alberto Caprara, Maxim Sviridenko	Improved approximation algorithms for multidimensional bin packing problems.	FOCS	2006	DBLP DOI BibTeX RDF
25	Vijay Kumar, Atri Rudra	Approximation Algorithms for Wavelength Assignment.	FSTTCS	2005	DBLP DOI BibTeX RDF
25	Lisa Fleischer	A fast approximation scheme for fractional covering problems with variable upper bounds.	SODA	2004	DBLP BibTeX RDF
25	Michael Elkin, Guy Kortsarz	Sublogarithmic approximation for telephone multicast: path out of jungle.	SODA	2003	DBLP BibTeX RDF
25	Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos	Completeness in Differential Approximation Classes.	MFCS	2003	DBLP DOI BibTeX RDF
25	Sudipta Sengupta	Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.	WADS	2003	DBLP DOI BibTeX RDF
25	Ju-Sheng Mi, Wen-Xiu Zhang	Composition of General Fuzzy Approximation Spaces.	AFSS	2002	DBLP DOI BibTeX RDF
25	Lisa Fleischer	A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.	IPCO	2001	DBLP DOI BibTeX RDF
25	Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin	Approximation algorithms for the metric labeling problem via a new linear programming formulation.	SODA	2001	DBLP BibTeX RDF
25	Khanh Vu, Kien A. Hua, Hao Cheng 0001, Sheau-Dong Lang	Bounded Approximation: A New Criterion for Dimensionality Reduction Approximation in Similarity Search.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF	Information Search and Retrieval, Information Storage and Retrieval, Search process
25	Jaroslaw Byrka	An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
25	Uriel Feige, Mohit Singh	Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
25	Benjamin E. Birnbaum, Kenneth J. Goldman	An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Boulos Harb, Sampath Kannan, Andrew McGregor 0001	Approximating the Best-Fit Tree Under Lp Norms.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
25	Yossi Azar, Leah Epstein	Approximation Schemes for Covering and Scheduling on Related Machines.	APPROX	1998	DBLP DOI BibTeX RDF
25	Zeev Nutov	Approximating Rooted Connectivity Augmentation Problems.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
25	Johan Håstad	On Nontrivial Approximation of CSPs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser	Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Amit Deshpande 0001, Santosh S. Vempala	Adaptive Sampling and Fast Low-Rank Matrix Approximation.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
25	Jan Remy, Angelika Steger	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
25	Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag	Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
25	Markus Bläser	A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
25	Doratha E. Drake, Stefan Hougardy	Improved Linear Time Approximation Algorithms for Weighted Matchings.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
24	Hoang Tuy	Cutting Plane Methods for Global Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Inner approximation, Polyhedral annexation, Concavity cut, Intersection cut, Convexity cut, Nonlinear cut, Polyblock approximation, Monotonic optimization, Outer approximation, Cutting plane method
24	Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia	Socially desirable approximations for Dodgson's voting rule.	EC	2010	DBLP DOI BibTeX RDF	dodgson's voting rule, approximation algorithms, social choice
24	Nikhil Bansal 0001, Zhen Liu, Arvind Sankar	Bin-packing with fragile objects and frequency allocation in cellular networks.	Wirel. Networks	2009	DBLP DOI BibTeX RDF	Approximation, Wireless communication, Cellular network, Bin-packing, Frequency allocation
24	Gero Greiner, Tim Nonner, Alexander Souza	The bell is ringing in speed-scaled multiprocessor scheduling.	SPAA	2009	DBLP DOI BibTeX RDF	dynamic speed scaling, approximation algorithms, randomized algorithms, online algorithms, scheduling algorithms, competitive analysis, energy minimization
24	Qun Zhao, Mohan Gurusamy	Lifetime maximization for connected target coverage in wireless sensor networks.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	sensor activity scheduling, wireless sensor networks, approximation algorithms, NP-complete, coverage, network lifetime
24	Abhimanyu Das, David Kempe 0001	Algorithms for subset selection in linear regression.	STOC	2008	DBLP DOI BibTeX RDF	subset selection, sparse approximation
24	Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, directed graphs, network design
24	Guoliang Xue, S. Kami Makki	Multiconstrained QoS Routing: A Norm Approach.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	multiple additive QoS parameters, scaled p{hbox{-}}rm norm, approximation algorithms, QoS routing
24	Jie Wang 0002, Ning Zhong 0001	Efficient point coverage in wireless sensor networks.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Approximation algorithms, Linear programming, Sensor placement
24	Chaitanya Swamy, Amit Kumar 0001	Primal-Dual Algorithms for Connected Facility Location Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Facility location, Primal-dual algorithms, Connected facility location
24	Paz Carmi, Thomas Erlebach, Yoshio Okamoto	Greedy Edge-Disjoint Paths in Complete Graphs.	WG	2003	DBLP DOI BibTeX RDF	Shortening lemma, Approximation algorithm, Greedy algorithm
24	Maciej Borkowski	Signal Analysis Using Rough Integrals.	Rough Sets and Current Trends in Computing	2002	DBLP DOI BibTeX RDF	rough integral, pattern recognition, rough sets, Approximation, sensor, signal analysis
24	Reuven Bar-Yehuda	One for the Price of Two: a Unified Approach for Approximating Covering Problems.	Algorithmica	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
24	Woongki Baek, Trishul M. Chilimbi	Green: a framework for supporting energy-conscious programming using controlled approximation.	PLDI	2010	DBLP DOI BibTeX RDF	controlled approximation, energy-conscious programming
24	Jaroslaw Byrka, Fabrizio Grandoni 0001, Thomas Rothvoß, Laura Sanità	An improved LP-based approximation for steiner tree.	STOC	2010	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design, linear programming relaxations
24	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
24	Guojun Li, Xiaotie Deng, Ying Xu 0001	A polynomial-time approximation scheme for embedding hypergraph in a cycle.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme
24	Jens Maßberg, Jens Vygen	Approximation algorithms for a facility location problem with service capacities.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithm, network design, VLSI design, facility location
24	Guoliang Xue, Weiyi Zhang 0001, Jian Tang 0008, Krishnaiyan Thulasiraman	Polynomial time approximation algorithms for multi-constrained QoS routing.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	efficient approximation algorithms, multiple additive constraints, quality-of-service (QoS) routing
24	Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson	Aperture-Angle and Hausdorff-Approximation of Convex Figures.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Hausdorff approximation, Aperture angle, Convex figure, Subpolygon
24	Hongcheng Wang, Narendra Ahuja	A Tensor Approximation Approach to Dimensionality Reduction.	Int. J. Comput. Vis.	2008	DBLP DOI BibTeX RDF	Rank-R tensor approximation, Multilinear analysis, Object recognition, Dimensionality reduction
24	Zeyu Guo 0001, He Sun 0001, Hong Zhu 0004	Greedy Construction of 2-Approximation Minimum Manhattan Network.	ISAAC	2008	DBLP DOI BibTeX RDF	Minimum Manhattan Network, greedy strategy, approximation algorithm
24	Ziv Bar-Yossef, Li-Tal Mashiach	Local approximation of pagerank and reverse pagerank.	CIKM	2008	DBLP DOI BibTeX RDF	reverse pagerank, lower bounds, pagerank, local approximation
24	Rolf Grütter, Thomas Scharrenbach, Bettina Bauer-Messmer	Improving an RCC-Derived Geospatial Approximation by OWL Axioms.	ISWC	2008	DBLP DOI BibTeX RDF	Geospatial approximation, Region Connection Calculus, Web Ontology Language, hypothesis testing, consistency checking
24	Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa	Improved approximation results for the stable marriage problem.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	incomplete lists, Approximation algorithms, ties, stable marriage problem
24	H. Mohebi 0001, Eskandar Naraghirad	Closed convex sets and their best simultaneous approximation properties with applications.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Simultaneous best approximation, Simultaneous pseudo-Chebyshev set, Simultaneous quasi-Chebyshev set, Conditionally complete lattice Banach space, Extremal point
24	Wei Wang 0039, Minos N. Garofalakis, Kannan Ramchandran	Distributed sparse random projections for refinable approximation.	IPSN	2007	DBLP DOI BibTeX RDF	AMS sketching, refinable approximation, sparse random projections, wireless sensor networks, compressed sensing
24	Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson	Aperture-angle and Hausdorff-approximation of convex figures.	SCG	2007	DBLP DOI BibTeX RDF	Hausdorff approximation, aperture angle, convex figure, subpolygon
24	Gábor Salamon	Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	MFCS	2007	DBLP DOI BibTeX RDF	Spanning tree leaves, Approximation algorithm, Hamiltonian path
24	Chengyi Zhang, Haiyan Fu	Isomorphic Fuzzy Sets and Fuzzy Approximation Space.	ICFIE	2007	DBLP DOI BibTeX RDF	fuzzy equivalent relation, granule computing, rough sets, fuzzy sets, approximation space
24	James F. Peters	Near Sets. Toward Approximation Space-Based Object Recognition.	RSKT	2007	DBLP DOI BibTeX RDF	perceptual neighborhood, object recognition, feature, Approximation space, near set
24	Giulia Galbiati, Francesco Maffioli	Approximating Maximum Cut with Limited Unbalance.	WAOA	2006	DBLP DOI BibTeX RDF	approximation algorithm, randomized algorithm, semidefinite programming
24	Ya-feng Wu, Yinlong Xu, Guo-Liang Chen 0001	Approximation Algorithms for Steiner Connected Dominating Set.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	Steiner connected dominated set, approximation algorithm, graph algorithm, NP-hard
24	Doratha E. Drake Vinkemeier, Stefan Hougardy	A linear-time approximation algorithm for weighted matchings in graphs.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Approximation algorithm, maximum weight matching
24	Yi-Jen Chiang	New Approximation Results for the Maximum Scatter TSP.	Algorithmica	2005	DBLP DOI BibTeX RDF	Traveling salesperson problem (TSP), Maximum scatter TSP, Bottleneck TSP, Hamiltonian cycle/path, Optimization, Approximation algorithms, Matching
24	Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky	Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Quality of service, Approximation algorithm, Multicast, Interconnection network, Steiner tree
24	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
24	Jingde Du, Stavros G. Kolliopoulos	Implementing approximation algorithms for the single-source unsplittable flow problem.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Approximation algorithms, network flow, unsplittable flow
24	James F. Peters	Rough Ethology: Towards a Biologically-Inspired Study of Collective Behavior in Intelligent Systems with Approximation Spaces.	Trans. Rough Sets	2005	DBLP DOI BibTeX RDF	ethology, learning, rough sets, intelligent systems, behavior, swarm, Approximation space
24	Gerold Jäger, Anand Srivastav	Improved Approximation Algorithms for Maximum Graph Partitioning Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	maximum graph partitioning, semidefinite programming, approximation factor
24	Refael Hassin, Asaf Levin	An Approximation Algorithm for the Minimum Latency Set Cover Problem.	ESA	2005	DBLP DOI BibTeX RDF	Minimum sum set cover, minimum latency, approximation algorithm
24	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco	Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.	SIROCCO	2005	DBLP DOI BibTeX RDF	black hole search, approximation algorithm, mobile agent, NP-hardness, graph exploration
24	Zhipeng Cai 0001, Guohui Lin, Guoliang Xue	Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.	COCOON	2005	DBLP DOI BibTeX RDF	Capacitated Multicast Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree
24	Erich Novak, Ian H. Sloan, Henryk Wozniakowski	Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers.	Found. Comput. Math.	2004	DBLP DOI BibTeX RDF	Korobov spaces, Approximation, Randomized algorithms, Quantum computation, Tractability
24	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm
24	Guohui Lin, Tao Jiang 0001	A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	breakpoint graph, alternating cycle decomposition, k-set packing, approximation algorithm, genome rearrangement, maximum independent set, sorting by reversals
24	Xiao-Shan Gao, Ming Li 0017	Rational Quadratic Approximation to Real Plane Algebraic Curves.	GMP	2004	DBLP DOI BibTeX RDF	plane algebraic curve, quadratic Bézier curve, quadratic B-spline curve, topology determination, approximation, parametrization
24	Eyal Amir, Robert Krauthgamer, Satish Rao	Constant factor approximation of vertex-cuts in planar graphs.	STOC	2003	DBLP DOI BibTeX RDF	balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph
24	Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips	Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.	Algorithmica	1999	DBLP DOI BibTeX RDF	Approximation algorithm, Computational biology, Phylogeny
24	Daya Ram Gaur, Ramesh Krishnamurti	Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.	ISAAC	1999	DBLP DOI BibTeX RDF	hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
24	Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger	On-line and Off-line Approximation Algorithms for Vector Covering Problems.	ESA	1996	DBLP DOI BibTeX RDF	Approximation algorithm, on-line algorithm, covering problem, packing problem, worst case ratio