Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger	Approximation Schemes for Broadcasting in Heterogenous Networks.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
18	Roy Friedman, Alex Kogan	Brief announcement: deterministic dominating set construction in networks with bounded degree.	PODC	2010	DBLP DOI BibTeX RDF	dominating sets, bounded degree graphs, distributed approximation algorithms
18	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz	Resource Allocation in Bounded Degree Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation
18	Zheng Fang 0004, Jie Wang 0002, Donghui Zhang	Workload-Driven Compressed Skycube Queries in Wireless Applications.	WASA	2009	DBLP DOI BibTeX RDF	Compressed skycube, approximation algorithm
18	Wei-Zhi Wu 0001, You-Hong Xu	On Fuzzy Rough Set Algebras in Infinite Universes.	RSKT	2009	DBLP DOI BibTeX RDF	Fuzzy rough set algebras, Rough sets, Fuzzy sets, Fuzzy rough sets, Approximation operators
18	Kenneth L. Clarkson, David P. Woodruff	Numerical linear algebra in the streaming model.	STOC	2009	DBLP DOI BibTeX RDF	linear regression, low-rank approximation, matrix product
18	MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami	MaxMin allocation via degree lower-bounded arborescences.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, graphs, lift-and-project
18	Chaitanya Swamy, David B. Shmoys	Fault-tolerant facility location.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithms, facility location, k-median problem
18	Akiko Suzuki, Takeshi Tokuyama	Dense subgraph problems with output-density conditions.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	approximation algorithms, Combinatorial optimization, randomized algorithms, dense subgraph
18	Mohamed Saad 0001, Tamás Terlaky, Anthony Vannelli, Hu Zhang 0004	Packing trees in communication networks.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Steiner tree packing, Approximation algorithms, Communication networks, Multicast routing, Mathematical programming, Wavelength assignment
18	Krzysztof Onak, Anastasios Sidiropoulos	Circular partitions with applications to visualization and embeddings.	SCG	2008	DBLP DOI BibTeX RDF	visualization, approximation algorithms, embeddings, treemap, ultrametrics
18	Subhas Kumar Ghosh	Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks.	CSE	2008	DBLP DOI BibTeX RDF	Minimum Energy Broadcast, approximation algorithm, distributed algorithm
18	Shamama Anwar, K. Sridhar Patnaik	Actor Critic Learning: A Near Set Approach.	RSCTC	2008	DBLP DOI BibTeX RDF	ethogram, ethology, actor critic, rough sets, Adaptive learning, approximation space, near sets
18	Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark	A scalable algorithm for dispersing population.	J. Intell. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Forest ecosystem, Ecological dispersal model, Forest simulation model, Approximation algorithms, Biodiversity
18	James F. Peters, Shabnam Shahfar, Sheela Ramanna, Tony Szturm	Biologically-Inspired Adaptive Learning: A Near Set Approach.	FBIT	2007	DBLP DOI BibTeX RDF	Approximate adaptive learning, ethology, An approximation space ... serves as a formal counterpart of perception ability or observation. Ewa Orlowska, March, 1982, machine learning, perception, observation, behaviour, near set
18	Daniel Golovin	Stochastic packing-market planning.	EC	2007	DBLP DOI BibTeX RDF	probabilistic demand, approximation algorithms, mechanism design, combinatorial auctions, stochastic optimization
18	James F. Peters	Toward Approximate Adaptive Learning.	RSEISP	2007	DBLP DOI BibTeX RDF	Actor-critic, behaviour pattern, stopping time, perception, adaptive learning, approximation space
18	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar	Packing to angles and sectors.	SPAA	2007	DBLP DOI BibTeX RDF	geometric covering, approximation algorithms, directional antenna, bin packing
18	Weifa Liang	Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2006	DBLP DOI BibTeX RDF	Wireless communication network, energy consumption optimization, minimum node-weighted Steiner tree problem, ad hoc networks, approximation algorithm, multicasting, broadcasting, power awareness
18	Gruia Calinescu, Peng-Jun Wan	Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks.	Mob. Networks Appl.	2006	DBLP DOI BibTeX RDF	approximation algorithms, distributed algorithm, NP-hardness, topology control, power assignment
18	Jiawei Zhang	Approximating the two-level facility location problem via a quasi-greedy approach.	Math. Program.	2006	DBLP DOI BibTeX RDF	Two-level facility location, Quasi-greedy approach, Approximation algorithm, Linear programming relaxation
18	Piotr Berman, Martin Fürer, Alexander Zelikovsky	Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.	CSR	2006	DBLP DOI BibTeX RDF	parity matroid problem, Steiner trees, matroid, approximation ratio
18	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	2006	DBLP DOI BibTeX RDF	directed multicut, hardness of approximation, sparsest cut
18	Retsef Levi, Robin Roundy, David B. Shmoys	Provably near-optimal sampling-based algorithms for Stochastic inventory control models.	STOC	2006	DBLP DOI BibTeX RDF	inventory problems, sampling-based algorithms, approximation algorithms, black box
18	Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann	On Minimum k-Modal Partitions of Permutations.	LATIN	2006	DBLP DOI BibTeX RDF	monotone sequence, k-modal sequence, cocoloring, approximation algorithm, online algorithm, Mixed integer program, hardness, LP rounding
18	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximating Min-Max (Regret) Versions of Some Polynomial Problems.	COCOON	2006	DBLP DOI BibTeX RDF	min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas
18	Markus Bläser, Bodo Manthey	Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One.	Algorithmica	2005	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers
18	Davide Bilò, Guido Proietti	Range Augmentation Problems in Static Ad-Hoc Wireless Networks.	SIROCCO	2005	DBLP DOI BibTeX RDF	Connectivity Augmentation, Approximation Algorithms, Radio Networks, Network Survivability
18	Moses Charikar, Adriana Karagiozova	On non-uniform multicommodity buy-at-bulk network design.	STOC	2005	DBLP DOI BibTeX RDF	buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform
18	Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan	Algorithms for Minimizing Response Time in Broadcast Scheduling.	Algorithmica	2004	DBLP DOI BibTeX RDF	Scheduling, Approximation algorithms, Broadcasting
18	Dimitris Fotakis 0001, Paul G. Spirakis	Minimum Congestion Redundant Assignments to Tolerate Random Faults.	Algorithmica	2002	DBLP DOI BibTeX RDF	Redundant assignments, Fault-tolerance, Polynomial-time approximation algorithms
18	Vincenzo Liberatore	Circular Arrangements.	ICALP	2002	DBLP DOI BibTeX RDF	scheduling, Approximation algorithms, multicast, combinatorial optimization, broadcast disks
18	Martin Skutella	Convex quadratic and semidefinite programming relaxations in scheduling.	J. ACM	2001	DBLP DOI BibTeX RDF	unrelated machines, approximation algorithms, randomized algorithms, convex optimization, performance guarantee, scheduling theory, worst-case ratio
18	Tsan-sheng Hsu, Joseph C. Lee, Dian Rae Lopez, William A. Royce	Task Allocation on a Network of Processors.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	parallel/distributed systems, Scheduling, approximation algorithms
18	Evgeny V. Shchepin, Nodari Vakhania	Task Distributions on Multiprocessor Systems.	IFIP TCS	2000	DBLP DOI BibTeX RDF	independent jobs, unrelated processors, approximation algorithm, distribution, makespan
18	Ligang Liu, Guojin Wang	Recursive Formulae for Hermite Polynomial Approximations to Rational Bézier Curves.	GMP	2000	DBLP DOI BibTeX RDF	Rational Bézier curve, hybrid curve, Hermite curve, polynomial approximation
18	Yayun Zhou, Jörg Schulze, Stefan Schäffler	Blade geometry design with kinematic ruled surface approximation.	SAC	2010	DBLP DOI BibTeX RDF	blade, dual spherical spline, geometry design, ruled surface, approximation
18	Joseph S. B. Mitchell	A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.	SCG	2010	DBLP DOI BibTeX RDF	approximation algorithm, TSP
18	Roman V. Efremov, Georgy K. Kamenev	Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems.	Ann. Oper. Res.	2009	DBLP DOI BibTeX RDF	Polyhedral approximation, Estimation refinement method, Feasible goals method, Multicriteria optimization
18	Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov	A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Approximation algorithms, graphs, connectivity
18	Zhi-Zhong Chen, Lusheng Wang 0001	Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	approximation algorithms, Computational biology
18	Jan Remy, Angelika Steger	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Computational geometry, Approximation schemes, Steiner tree problem
18	Feilong Cao, Yongquan Zhang, Zongben Xu	Lower estimation of approximation rate for neural networks.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	topology structure of hidden layer, lower, approximation, feedforward neural networks, rate
18	Anna Gomolinska	Rough Approximation Based on Weak q-RIFs.	Trans. Rough Sets	2009	DBLP DOI BibTeX RDF	weak quasi-rough inclusion, rough approximation space, rough inclusion
18	Guang Xu, Jinhui Xu 0001	An improved approximation algorithm for uncapacitated facility location problem with penalties.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Algorithms, Approximation algorithms, Outliers, Facility location problem
18	Zhenbo Wang, Wenxun Xing	A successive approximation algorithm for the multiple knapsack problem.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Approximation algorithm, Worst-case analysis, Multiple knapsack problem
18	Hua Li 0002, Héctor Muñoz-Avila, Diane Bramsen, Chad Hogg, Rafael Alonso	Spatial Event Prediction by Combining Value Function Approximation and Case-Based Reasoning.	ICCBR	2009	DBLP DOI BibTeX RDF	spatial prediction, case-based prediction, function value approximation
18	Chi Shen, Mike Unuakhalu	A class of multistep sparse matrix strategies for concept decomposition matrix approximation.	SAC	2009	DBLP DOI BibTeX RDF	concept decomposition matrix, multistep, sparse matrix approximation, term-document matrix, least-squares
18	Timothy M. Chan, Sariel Har-Peled	Approximation algorithms for maximum independent set of pseudo-disks.	SCG	2009	DBLP DOI BibTeX RDF	approximation., local search
18	Shiyan Hu, Zhuo Li 0001, Charles J. Alpert	A faster approximation scheme for timing driven minimum cost layer assignment.	ISPD	2009	DBLP DOI BibTeX RDF	dynamic programming, np-complete, oracle, fully polynomial time approximation scheme, layer assignment
18	Guangzhong Sun, Zhong Zhang, Jing Yuan 0007	An efficient pre-computation technique for approximation KNN search in road networks.	GIS-LBSN	2009	DBLP DOI BibTeX RDF	pre-computation, approximation, road networks, KNN
18	Farzad Hassanzadeh, David Rappaport	Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.	WADS	2009	DBLP DOI BibTeX RDF	Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment
18	T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan	The Guarding Problem - Complexity and Approximation.	IWOCA	2009	DBLP DOI BibTeX RDF	QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
18	Yan-Qing Yao, Ju-Sheng Mi	Fuzzy Concept Lattices Determined by (theta, sigma)-Fuzzy Rough Approximation Operators.	RSKT	2009	DBLP DOI BibTeX RDF	Fuzzy concept lattices, (?and ?)-fuzzy rough sets, Lukasiewicz implicator, Approximation operators
18	Yen Hung Chen	A Fast Approximation Algorithm for the k Partition-Distance Problem.	ICCSA (2)	2009	DBLP DOI BibTeX RDF	partition-distance, data mining, clustering, approximation algorithm, bioinformatics, partitioning, consensus clustering
18	Jianfeng Ren, Yuzhong Zhang, Xianzhao Zhang, Guo Sun	Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine.	COCOA	2009	DBLP DOI BibTeX RDF	Unbounded batch machine, Approximation algorithms, Dynamic programming
18	Anupam Gupta 0001, Amit Kumar 0001	A constant-factor approximation for stochastic Steiner forest.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, stochastic algorithms
18	Yuichi Nakamura 0006, Masahiro Nakagawa	Approximation Capability of Continuous Time Recurrent Neural Networks for Non-autonomous Dynamical Systems.	ICANN (2)	2009	DBLP DOI BibTeX RDF	Continuous Time Recurrent Neural Network, Non-autonomous, Approximation, Dynamical system, Capability
18	Fei Han 0001, De-Shuang Huang	A new constrained learning algorithm for function approximation by encoding a priori information into feedforward neural networks.	Neural Comput. Appl.	2008	DBLP DOI BibTeX RDF	The a priori information, Generalization performance, Function approximation, Feedforward neural networks, Convergent rate
18	Maleq Khan, Gopal Pandurangan	A fast distributed approximation algorithm for minimum spanning trees.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm
18	Tao Li	Clustering based on matrix approximation: a unifying view.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Clustering, Subspace, Matrix approximation, Alternating optimization
18	Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi	A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.	Algorithmica	2008	DBLP DOI BibTeX RDF	The stable marriage problem, Incomplete lists, Approximation algorithms, Ties
18	Hadas Shachnai, Tami Tamir, Omer Yehezkely	Approximation Schemes for Packing with Item Fragmentation.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Item fragmentation, Algorithms, Linear programming, Bin packing, Polynomial time approximation schemes
18	Carl de Boor, Christian Gout, Angela Kunoth, Christophe Rabut	Multivariate approximation: theory and applications. An overview.	Numer. Algorithms	2008	DBLP DOI BibTeX RDF	Multiscale and wavelets modelling, Image processing, Approximation, Applications, Radial basis functions, Splines, Quaternions
18	Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa	Approximation algorithms for connected facility location problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Integer programming, Steiner tree, LP-rounding, Connected facility location
18	Wei Fan, Yusuke Koyanagi, Koichi Asakura, Toyohide Watanabe	Clustering over Evolving Data Streams Based on Online Recent-Biased Approximation.	PKAW	2008	DBLP DOI BibTeX RDF	Clustering over evolving data streams, recent-biased approximation, data mining, time series data
18	Artur Przelaskowski, Rafal Józwiak, Grzegorz Ostrek, Katarzyna Sklinda	Approximation of Subtle Pathology Signs in Multiscale Domain for Computer-Aided Ischemic Stroke Diagnosis.	ICCVG	2008	DBLP DOI BibTeX RDF	Image nonlinear approximation, multiscale image representation, ischemic stroke, computer aided diagnosis
18	Aris Anagnostopoulos, Anirban Dasgupta 0001, Ravi Kumar 0001	Approximation algorithms for co-clustering.	PODS	2008	DBLP DOI BibTeX RDF	clustering, approximation, biclustering, co-clustering
18	Bin Wang, Huazhong Shu, Bao-Sheng Li, Zhi-Mei Niu	A Mutation-Particle Swarm Algorithm for Error-Bounded Polygonal Approximation of Digital Curves.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Particle swarm optimization, Polygonal approximation, Mutation operators
18	Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.	MSWiM	2008	DBLP DOI BibTeX RDF	range assignment problems, approximation algorithms, distributed algorithms, probabilistic analysis
18	Md. Aquil Khan, Mohua Banerjee	Multiple-Source Approximation Systems: Membership Functions and Indiscernibility.	RSKT	2008	DBLP DOI BibTeX RDF	Rough membership functions, Rough sets, Approximation spaces
18	Ziv Bar-Yossef, Li-Tal Mashiach	Local approximation of PageRank and reverse PageRank.	SIGIR	2008	DBLP DOI BibTeX RDF	reverse PageRank, lower bounds, PageRank, local approximation
18	Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa	Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem.	COCOA	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Primal-Dual algorithms, Facility location problem
18	Zhipeng Cai 0001, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang 0001	An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.	COCOA	2008	DBLP DOI BibTeX RDF	Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree
18	Lap Chi Lau, Mohit Singh	Additive approximation for bounded degree survivable network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design
18	Per Austrin, Elchanan Mossel	Approximation Resistant Predicates from Pairwise Independence.	CCC	2008	DBLP DOI BibTeX RDF	Max k-CSP, Approximation Resistance, Pairwise Independence, Unique Games Conjecture
18	Jean Cardinal, Eythan Levy	Connected Vertex Covers in Dense Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	connected vertex cover, dense graph, approximation algorithm, vertex cover
18	Ioannis C. Demetriou	Algorithm 863: L2WPMA, a Fortran 77 package for weighted least-squares piecewise monotonic data approximation.	ACM Trans. Math. Softw.	2007	DBLP DOI BibTeX RDF	data smoothing, peak finding, piecewise monotonic, pound/dollar exchange rate, turning point, image processing, dynamic programming, Approximation, signal processing, histogram, spline, fitting, Lagrange multipliers, isotonic regression, divided difference
18	Hongtu Zhu, Minggao Gu, Bradley S. Peterson	Maximum likelihood from spatial random effects models via the stochastic approximation expectation maximization algorithm.	Stat. Comput.	2007	DBLP DOI BibTeX RDF	Spatial random effects models, Markov random fields, Markov chain Monte Carlo, Expectation maximization, Stochastic approximation
18	Luca Becchetti, Jochen Könemann, Stefano Leonardi 0001, Martin Pál	Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Steiner forests, Approximation algorithms, network design, cost sharing
18	Xiaochun Xu, Sartaj Sahni	Approximation Algorithms for Sensor Deployment.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	point coverage, multimodal sensors, Wireless sensor networks, approximation algorithm
18	Faming Liang	Annealing stochastic approximation Monte Carlo algorithm for neural network training.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Multiple layer perceptron, Wang-Landau algorithm, Simulated annealing, Markov chain Monte Carlo, Back-propagation, Stochastic approximation, Convergence rate
18	Partha Bhowmick, Bhargab B. Bhattacharya	Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	digital straight line, shape analysis, Digital geometry, polygonal approximation
18	Minghui Jiang 0001	A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	2-Interval, Approximation algorithms, RNA secondary structure prediction
18	Marco F. Huber, Uwe D. Hanebeck	Hybrid transition density approximation for efficient recursive prediction of nonlinear dynamic systems.	IPSN	2007	DBLP DOI BibTeX RDF	hybrid density, nonlinear prediction, probability density approximation, recursive bayesian estimation
18	Ehab Morsy, Hiroshi Nagamochi	Approximation to the Minimum Cost Edge Installation Problem.	ISAAC	2007	DBLP DOI BibTeX RDF	Approximation algorithm, Graph algorithm, Network optimization, Routing problem
18	Naoki Fukuta, Takayuki Ito 0001	Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms.	DEECS	2007	DBLP DOI BibTeX RDF	approximation algorithms, combinatorial auction
18	Fei Han 0001, Qing-Hua Ling	A New Learning Algorithm for Function Approximation by Encoding Additional Constraints into Feedforward Neural Network.	ICIC (3)	2007	DBLP DOI BibTeX RDF	additional constraints, Function approximation, feedforward neural network
18	Prabhakar Gubbala, Balaji Raghavachari	A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity.	WADS	2007	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial Optimization, Connectivity, Graph and network algorithms
18	O. Eljamaly Toumaz, P. Sweeney	Alternative Approximation of Check Node Algorithm for DVB-S2 LDPC Decoder.	ICSNC	2007	DBLP DOI BibTeX RDF	Min-Sum, check nodes algorithm, alternative approximation, computational complexity, LDPC codes
18	Arash Asadpour, Amin Saberi	An approximation algorithm for max-min fair allocation of indivisible goods.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithms, game theory, randomized rounding
18	Amit Deshpande 0001, Kasturi R. Varadarajan	Sampling-based dimension reduction for subspace approximation.	STOC	2007	DBLP DOI BibTeX RDF	subspace approximation
18	Amit Agarwal, Noga Alon, Moses Charikar	Improved approximation for directed cut problems.	STOC	2007	DBLP DOI BibTeX RDF	directed multicut, directed sparsest cut, approximation algorithm, linear programming relaxation
18	Fabian Kuhn, Thomas Moscibroda	Distributed approximation of capacitated dominating sets.	SPAA	2007	DBLP DOI BibTeX RDF	distributed approximation, capacities, dominating sets, LP relaxation
18	Nicholas K. Jong, Peter Stone	Model-based function approximation in reinforcement learning.	AAMAS	2007	DBLP DOI BibTeX RDF	models, reinforcement learning, function approximation
18	Seungjin Choi, Jong-Hoon Ahn, Andrzej Cichocki	Constrained Projection Approximation Algorithms for Principal Component Analysis.	Neural Process. Lett.	2006	DBLP DOI BibTeX RDF	natural power iteration, projection approximation, principal component analysis, reconstruction error, subspace analysis
18	Klaus Jansen, Hu Zhang 0004	An approximation algorithm for scheduling malleable tasks under general precedence constraints.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	malleable tasks, scheduling, Approximation algorithms, precedence constraints
18	David B. Shmoys, Chaitanya Swamy	An approximation scheme for stochastic linear programming and its application to stochastic integer programs.	J. ACM	2006	DBLP DOI BibTeX RDF	Approximation algorithms, randomized algorithms, convex optimization
18	Maoguo Gong, Haifeng Du, Licheng Jiao	Optimal approximation of linear systems by artificial immune response.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	approximation of linear systems, immunological memory, artificial immune systems, clonal selection, immune response
18	Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan	Approximation algorithms for shop scheduling problems with minsum objective: A correction.	J. Sched.	2006	DBLP DOI BibTeX RDF	Shop scheduling, Approximation algorithms