Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
3875
search results - page 14 / 775
»
Approximation Algorithms for the Max-coloring Problem
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
STOC
1991
ACM
95
views
Algorithms
»
more
STOC 1991
»
Fast Approximation Algorithms for Multicommodity Flow Problems
13 years 11 months ago
Download
historical.ncstrl.org
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
claim paper
Read More »
22
click to vote
SODA
1998
ACM
89
views
Algorithms
»
more
SODA 1998
»
Approximation Algorithms for Directed Steiner Problems
13 years 8 months ago
Download
www.ece.uc.edu
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu...
claim paper
Read More »
25
click to vote
ATAL
2007
Springer
157
views
Intelligent Agents
»
more
ATAL 2007
»
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
13 years 11 months ago
Download
www.aamas-conference.org
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
claim paper
Read More »
18
click to vote
STOC
1994
ACM
97
views
Algorithms
»
more
STOC 1994
»
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
13 years 11 months ago
Download
www.cs.uwaterloo.ca
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
claim paper
Read More »
18
click to vote
4OR
2008
56
views
more
4OR 2008
»
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
13 years 7 months ago
Download
www.lri.fr
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz
claim paper
Read More »
« Prev
« First
page 14 / 775
Last »
Next »