frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

StreetComplete: Fixing OpenStreetMap, one tiny quest at a time

https://streetcomplete.app/
540•kls0e•7h ago•125 comments

AI Meets Cryptography 1: What AI Found in Cloudflare's Circl

https://blog.zksecurity.xyz/posts/circl-bugs/
29•duha•1h ago•1 comments

Local, CPU-Friendly, High-Quality TTS (Text-to-Speech) with Kokoro

https://ariya.io/2026/03/local-cpu-friendly-high-quality-tts-text-to-speech-with-kokoro/
49•speckx•1h ago•12 comments

Chat Control 1.0 and 2.0 Explained

https://fightchatcontrol.eu/chat-control-overview
214•gasull•5h ago•61 comments

30papers.com – Ilya's 30 essential ML papers, in a beginner friendly format

https://30papers.com/
194•notmcrowley•4h ago•34 comments

l: A new runtime for k and q

https://lv1.sh/
40•skruger•1h ago•21 comments

A better way to tie gym shorts (or any drawstring) [video]

https://www.youtube.com/watch?v=3R0Lp86GEBk
373•surprisetalk•7h ago•140 comments

Jim's TrueType QR Code Font

https://github.com/jimparis/qr-font
73•arantius•3h ago•6 comments

Notes on Software Quality

https://anthonyhobday.com/blog/20260410
22•speckx•1h ago•6 comments

Fixing analog audio on the $2.58 HDMI-to-VGA adapter

https://nyanpasu64.gitlab.io/blog/hdmi-vga-dac-audio/
35•zdw•2d ago•10 comments

Show HN: Davit, a Apple Containers UI

https://davit.app
19•xinit•1h ago•1 comments

Why we built yet another Postgres connection pooler

https://pgdog.dev/blog/why-yet-another-connection-pooler
72•levkk•4h ago•9 comments

Show HN: Docx-CLI: agents read/edit Word docs using 1/2 the time and tokens

https://github.com/kklimuk/docx-cli
18•kirillklimuk•1h ago•7 comments

Astro 7.0

https://astro.build/blog/astro-7/
101•saikatsg•1h ago•23 comments

Show HN: Rowboat – Open-source, local-first alternative to Claude Desktop

https://github.com/rowboatlabs/rowboat
11•segmenta•3h ago•2 comments

MacSurf 1.68 – NetSurf on OS 9 Released

https://github.com/mplsllc/macsurf/releases/tag/v1.86
48•mplsllc•3h ago•8 comments

Chat Control passed first round in EU Parliament

https://www.heise.de/en/news/Showdown-in-Strasbourg-The-unexpected-return-of-Chat-Control-1-0-113...
416•miroljub•4h ago•187 comments

Automating AI Away

https://replicated.live/blog/away
57•gritzko•4h ago•30 comments

China sentences official to death for taking $325M in bribes

https://www.bbc.com/news/articles/c33y0n1v1xjo
173•randycupertino•3h ago•193 comments

Herdr: One terminal to rule them all

https://herdr.dev/
5•handfuloflight•5d ago•0 comments

The revenge of the philosophy majors

https://www.nytimes.com/2026/07/05/business/philosophy-majors-ai-jobs.html
96•benbreen•5h ago•147 comments

9 Mothers (YC P26) Is Hiring in Austin, TX

https://9mothers.com/careers
1•ukd1•8h ago

Microsoft fire idTech team at Id software

https://gamefromscratch.com/microsoft-fire-idtech-team-at-id-software/
382•bauc•4h ago•381 comments

Computational Balloon Twisting: The Theory of Balloon Polyhedra [pdf]

https://cccg.ca/proceedings/2008/paper34full.pdf
15•luu•5d ago•0 comments

Show HN: Halo – open-source, tamper-evident runtime evidence for AI agents

https://github.com/bkuan001/halo-record
7•brian_kuan•5h ago•1 comments

98% isn't much

https://whynothugo.nl/journal/2026/07/03/98-isnt-very-much/
407•speckx•7h ago•265 comments

Why skilled workers come to Germany and then leave again

https://www.dw.com/en/germany-migrants-skilled-workers-integration-labor-market-bureaucracy-langu...
84•theanonymousone•9h ago•184 comments

Amazon without the knockoffs

https://knockoff.shopping/
262•plurby•4h ago•182 comments

GitHub Freno: cooperative, highly available throttler service

https://github.com/github/freno
25•nateb2022•1d ago•0 comments

Reducing Doom Loops with Final Token Preference Optimization

https://www.liquid.ai/blog/antidoom
18•dataminer•3h ago•4 comments
Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•1y ago

Comments

buildsjets•1y ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•1y ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•1y ago
(2003)
throw0101b•1y ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•1y ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•1y ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•1y ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•1y ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/