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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
4843
search results - page 61 / 969
»
The Shortcut Problem - Complexity and Approximation
Sort
relevance
views
votes
recent
update
View
thumb
title
96
click to vote
EOR
2007
81
views
more
EOR 2007
»
A note on the approximability of cutting stock problems
15 years 2 months ago
Download
www.ic.unicamp.br
G. F. Cintra, Flávio Keidi Miyazawa, Yoshik...
claim paper
Read More »
138
click to vote
NETWORKS
2008
142
views
Computer Networks
»
more
NETWORKS 2008
»
Approximation bounds for Black Hole Search problems
15 years 2 months ago
Download
hal.archives-ouvertes.fr
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
claim paper
Read More »
83
click to vote
MP
2006
73
views
more
MP 2006
»
Tractable Approximations to Robust Conic Optimization Problems
15 years 2 months ago
Download
bschool.nus.edu
Dimitris Bertsimas, Melvyn Sim
claim paper
Read More »
79
click to vote
ORL
2008
82
views
more
ORL 2008
»
An approximation algorithm for the wireless gathering problem
15 years 2 months ago
Download
www.win.tue.nl
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchet...
claim paper
Read More »
86
click to vote
SIAMDM
2008
77
views
more
SIAMDM 2008
»
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
15 years 2 months ago
Download
pluto.huji.ac.il
Asaf Levin
claim paper
Read More »
« Prev
« First
page 61 / 969
Last »
Next »